|
7709
|
Computers and Intractability: A Guide to the Theory of NP-Completeness
– Garey, Johnson
- 1979
|
|
1289
|
The Probabilistic Method
– Alon, Spencer, et al.
- 1992
|
|
1258
|
Randomized Algorithms
– Motwani, Raghavan
- 1997
|
|
804
|
Combinatorial Optimization: Algorithms and Complexity
– Papadimitriou, Steiglitz
- 1982
|
|
731
|
Integer and Combinatorial Optimization
– Nemhauser, Wolsey
- 1988
|
|
503
|
Optimization, approximation, and complexity classes
– Papadimitriou, Yannakakis
- 1991
|
|
457
|
Approximation algorithms for combinatorial problems
– Johnson
- 1974
|
|
317
|
On the hardness of approximating minimization problems
– Lund, Yannakakis
- 1994
|
|
295
|
The geometry of graphs and some of its algorithmic applications
– LINIAL, LONDON, et al.
- 1994
|
|
271
|
Probabilistic construction of deterministic algorithms: Approximating packing integer programs
– Raghavan
- 1988
|
|
239
|
A general approximation technique for constrained forest problems
– Goemans, Williamson
- 1995
|
|
239
|
Randomized rounding: a technique for provably good algorithms and algorithmic proofs
– Raghavan, Thompson
- 1987
|
|
231
|
A greedy heuristic for the set-covering problem
– Chvatal
- 1979
|
|
230
|
Approximation algorithms for NP-complete problems on planar graphs
– Baker
- 1994
|
|
223
|
Polynomial Time Approximation Schemes for Euclidean TSP and other Geometric Problems
– Arora
- 1996
|
|
207
|
An approximate max-flow min-cut theorems for uniform multicommodity flow problem with applications to approximation algorithms
– Leighton, Rao
- 1988
|
|
168
|
Worst-Case Analysis of a New Heuristic for the Traveling Salesman Problem, Management Science Research
– Christofides
- 1976
|
|
136
|
When trees collide: An approximation algorithm for the generalized Steiner problem on networks
– Agrawal, Klein, et al.
- 1995
|
|
131
|
Approximate Graph Coloring by Semidefinite Programming
– Karger, Motwani, et al.
- 1994
|
|
112
|
The hardness of approximate optima in lattices, codes, and systems of linear equations
– Arora, Babai, et al.
- 1997
|
|
106
|
Approximate max-flow min-(multi)cut theorems and their applications
– Garg, Vazirani, et al.
|
|
98
|
Approximation algorithms of the set covering and vertex cover problems
– Hochbaum
- 1982
|
|
85
|
Divide-and-Conquer Approximation Algorithms via Spreading Metrics
– Even, Naor, et al.
|
|
83
|
An 11/6-approximation algorithm for the network Steiner problem, Algorithmica 9
– Zelikovsky
- 1993
|
|
82
|
Improved approximations for the Steiner tree problem
– Berman, Ramaiyer
- 1994
|
|
82
|
Clique is hard to approximate within n 1−ɛ
– H˚astad
- 1999
|
|
80
|
Faster approximation algorithms for the unit capacity concurrent flow problem with applications to routing and finding sparse cuts
– Klein, Plotkin, et al.
- 1994
|
|
78
|
Clique is hard to approximate within n 1\Gammaffl
– Hastad
- 1996
|
|
76
|
A unified approach to approximation algorithms for bottleneck problem
– Hochbaum, Shmoys
- 1986
|
|
69
|
A primal-dual approximation algorithm for generalized Steiner network problems
– Williamson, Goemans, et al.
- 1995
|
|
65
|
878Approximation Algorithms for MAX CUT and MAX 2SAT
– Goemans, Williamson
- 1994
|
|
63
|
Randomized rounding without solving the linear program
– Young
- 1996
|
|
60
|
Ten lectures on the probabilistic method
– Spencer
- 1994
|
|
58
|
Linear Approximation of Shortest Superstring
– Blum, Jiang, et al.
- 1994
|
|
58
|
Biconnectivity approximations and graph carvings
– Khuller, Vishkin
- 1994
|
|
57
|
Packing directed circuits fractionally
– Seymour
- 1995
|
|
53
|
An efficient approximation algorithm for the survivable network design problem
– Gabow, Goemans, et al.
- 1993
|
|
52
|
A compendium of NP optimization problems. http://www.nada.kth.se/theory/problemlist.html
– Crescenzi, Kann
- 2000
|
|
52
|
Improved approximation algorithms for uniform connectivity problems
– Khuller, Raghavachari
- 1996
|
|
51
|
On approximating the longest path in a graph
– Karger, Motwani, et al.
- 1997
|
|
47
|
Approximating the minimum-degree Steiner tree to within one of optimal
– Fürer, Raghavachari
- 1994
|
|
43
|
Adding multiple cost constraints to combinatorial optimization problems, with applications to multicommodity flows
– Karger, Plotkin
- 1995
|
|
39
|
An approximation algorithm for minimum-costvertex-connectivity problems. Algorithmica
– Ravi, Williamson
- 1997
|
|
37
|
On the ratio of optimal integral and fractional covers. Discrete Math
– Lovasz
- 1975
|
|
37
|
Rapid rumor ramification: Approximating the minimum broadcast time
– Ravi
- 1994
|
|
37
|
Many birds with one stone: Multi-objective approximation algorithms
– Ravi, Marathe, et al.
- 1993
|
|
37
|
approximation bounds for the network and Euclidean Steiner tree problems
– Better
- 1996
|
|
35
|
Approximation algorithms for graph augmentation
– Khuller, Thurimella
- 1993
|
|
34
|
When cycles collapse: A general approximation technique for constrained twoconnectivity problems
– Klein, Ravi
- 1993
|
|
33
|
Fast approximate graph partitioning algorithms
– Even, Naor, et al.
- 1997
|
|
