Keyword: greedy algorithms

Found 19 papers in total
Greedy Δ-Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost
Greedy Δ-Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost
2013,
This paper describes a simple greedy Δ ‐approximation algorithm for any...
The minimum maximal k‐partial‐matching problem
The minimum maximal k‐partial‐matching problem
2013,
In this paper, we introduce a new problem related to bipartite graphs called minimum...
A hybrid algorithm for constrained order packing
A hybrid algorithm for constrained order packing
2014,
Constraint order packing, which is an extension to the classical...
Multi‐objective sequence dependent setup times permutation flowshop: A new algorithm and a comprehensive study
Multi‐objective sequence dependent setup times permutation flowshop: A new algorithm and a comprehensive study
2013,
The permutation flowshop scheduling problem has been thoroughly studied in recent...
An adaptive search for the response time variability problem☆
An adaptive search for the response time variability problem☆
2012,
The Response Time Variability Problem (RTVP) is an NP‐hard combinatorial...
A GRASP algorithm for the Closest String Problem using a probability‐based heuristic
A GRASP algorithm for the Closest String Problem using a probability‐based heuristic
2012,
The Closest String Problem (CSP) is the problem of finding a string whose Hamming...
Minimizing the sum cost in linear extensions of a poset
Minimizing the sum cost in linear extensions of a poset
2011,
A linear extension problem is defined as follows: Given a poset P =( E ,≤), we want...
Stability and performance of greedy server systems
Stability and performance of greedy server systems
2011,
Consider a queueing system in which arriving customers are placed on a circle and wait...
A Greedy Partition Lemma for directed domination
A Greedy Partition Lemma for directed domination
2011,
A directed dominating set in a directed graph D is a set S of vertices of V such that...
Finding socially best spanning trees
Finding socially best spanning trees
2011,
This article combines Social Choice Theory with Discrete Optimization. We assume that...
On the Planarization of Wireless Sensor Networks
On the Planarization of Wireless Sensor Networks
2011,
Network planarization has been an important technique in numerous sensornet...
Tight Approximation Ratio of a General Greedy Splitting Algorithm for the Minimum k‐Way Cut Problem
Tight Approximation Ratio of a General Greedy Splitting Algorithm for the Minimum k‐Way Cut Problem
2011,
For an edge‐weighted connected undirected graph, the minimum k ‐way cut...
Greedy algorithms for on-line set-covering
Greedy algorithms for on-line set-covering
2009,
We study on-line models for the set-covering problem in which items from a ground set...
Characterizations of polygreedoids and poly-antimatroids by greedy algorithms
Characterizations of polygreedoids and poly-antimatroids by greedy algorithms
2005,
A polygreedoid and a poly-antimatroid are the generalization of a greedoid and an...
An approximation algorithm for a large-scale facility location problem
An approximation algorithm for a large-scale facility location problem
2003,
We developed a new practical optimization method that gives approximate solutions for...
A new look at a greedy algorithm for solving a class of convex programming problems
A new look at a greedy algorithm for solving a class of convex programming problems
1999,
Morton et al. describe a greedy algorithm for solving a class of convex programming...
Stochastic analysis of greedy algorithms for the subset sum problem
Stochastic analysis of greedy algorithms for the subset sum problem
1999,
The subset sum problem is the selection of a subset of items from a given ground set...
Greedy sets and related problems
Greedy sets and related problems
1997,
A set D is called greedy if the greedy algorithm solves the problem max { cx |...
On structures of bisubmodular polyhedra
On structures of bisubmodular polyhedra
1996,
A bisubmodular polyhedron is defined in terms of a so-called bisubmodular function on...
Papers per page: