|
5
|
Improved Performance of the Greedy Algorithm for the Minimum Set Cover and Minimum Partial Cover Problems
– Petr Slavík
- 1995
|
|
19
|
Inapproximability of combinatorial optimization problems
– Luca Trevisan
- 2004
|
|
1
|
Approximating Minimum Keys and Optimal Substructure Screens
– Tatsuya Akutsu, Feng Bao
|
|
51
|
Approximating the Domatic Number
– Uriel Feige, Magnús M. Halldórsson, Guy Kortsarz, Aravind Srinivasan
|
|
2
|
Steiner Trees and Beyond: Approximation Algorithms for Network Design
– Ramamurthy Ravi
- 1993
|
|
18
|
Geometric sensing of known planar shapes
– Yan-bin Jia, Michael Erdmann
- 1996
|
|
133
|
Almost optimal set covers in finite VC-dimension
– Herve Brönnimann, Michael T. Goodrich
|
|
11
|
The approximability of NP-hard problems
– Sanjeev Arora
- 1998
|
|
27
|
Approximation of k-Set Cover by Semi-Local Optimization
– Rong-Chii Duh, Martin Fürer
- 1997
|
|
|
Greedy Set-Cover Algorithms
– Neal E. Young
|
|
4
|
Interference in cellular networks: The minimum membership set cover problem
– Fabian Kuhn, Pascal Von Rickenbach, Roger Wattenhofer, Emo Welzl, Aaron Zollinger
- 2005
|
|
4
|
Approximating the unweighted k-set cover problem: greedy meets local search
– Asaf Levin
- 2006
|
|
6
|
A better-than-greedy approximation algorithm for the minimum set cover problem
– Refael Hassin, Asaf Levin
- 2006
|
|
1
|
Primal-dual algorithms for combinatorial optimization problems
– Julián Mestre
- 2007
|
|
15
|
A Fuzzy Genetic Algorithm for Driver Scheduling
– Jingpeng Li, Raymond S. K. Kwan
- 2003
|
|
20
|
Complexity Measures for Assembly Sequences
– Michael Goldwasser, Jean-claude Latombe, Rajeev Motwani
- 1996
|
|
|
Coping with NP-hardness: Approximating minimum bisection and heuristics for maximum clique
– Robert Krauthgamer
- 2001
|
|
|
Paired Approximation Problems and Incompatible Inapproximabilities
– David Eppstein
- 2010
|
|
|
Abstract
– Ashkan Aazami, Michael David Stilp
- 2008
|
