|
7271
|
Computers and Intractability - A Guide to the Theory of NP-Completeness
– Garey, Johnson
- 1979
|
|
986
|
Theory of Linear and Integer Programming
– Schrijver
- 1986
|
|
853
|
Combinatorial Optimization: Algorithms and Complexity
– Papadimitriou, Steiglitz
- 1982
|
|
789
|
Geometric Algorithms and Combinatorial Optimization, Springer-Verlag
– Grotschel, Lov'asz, et al.
- 1987
|
|
471
|
Approximation algorithms for combinatorial problems. Proceedings of the fifth annual ACM symposium on Theory of computing 38–49
– Johnson
- 1973
|
|
332
|
Combinatorial Optimization: Networks and Matroids
– Lawler
- 1976
|
|
240
|
A Greedy Heuristic for the Set-Covering Problem
– Chvatal
- 1979
|
|
232
|
Bounds for certain multiprocessing anomalies
– Graham
- 1966
|
|
223
|
The ellipsoid method and its consequences in combinatorial optimization
– Grotschel, Lov'asz, et al.
- 1981
|
|
217
|
Sequencing and Scheduling: Algorithms and Complexity
– Lawler, Lenstra, et al.
- 1990
|
|
189
|
T.Gonzalez. P-complete approximation problems
– Sahni
- 1976
|
|
179
|
Worst-case analysis of a new heuristic for the travelling salesman problem
– Christofides
- 1976
|
|
170
|
Every planar map is four colorable
– Appel, Haken, et al.
- 1977
|
|
154
|
The NP-completeness column: an ongoing guide
– Johnson
- 1982
|
|
139
|
Integer programming with a fixed number of variables
– Lenstra
- 1983
|
|
133
|
Fast approximation algorithms for the knapsack and sum of subset problems
– Ibarra, Kim
- 1975
|
|
129
|
A Local-Ratio Theorem for Approximating the Weighted Vertex Cover Problem
– Bar-Yehuda, Even
- 1985
|
|
123
|
Applications of a planar separator theorem
– Lipton, Tarjan
- 1977
|
|
88
|
Approximation Algorithms for Set Covering and Vertex Cover Problems
– Hochbaum
- 1982
|
|
85
|
An analysis of several heuristics for the traveling salesman problem
– Rosenkrantz, Stearns, et al.
- 1977
|
|
83
|
An Efficient Approximation Scheme For The One-Dimensional Bin Packing Problem
– Karmakar, Karp
- 1982
|
|
82
|
Approximation algorithms for bin packing -- an updated survey
– Coffman, Garey, et al.
- 1984
|
|
82
|
Worst-case performance bounds for simple onedimensional packing algorithms
– Johnson, Demers, et al.
- 1974
|
|
65
|
Fast Approximation Algorithms for Knapsack Problems
– Lawler
- 1977
|
|
64
|
Strong NP-completeness Results: Motivations, Examples and Implications
– Garey, Johnson
- 1978
|
|
61
|
Efficient Bounds for the Stable Set, Vertex Cover and Set Packing Problems
– Hochbaum
- 1983
|
|
57
|
Improving the Performance Guarantee for Approximate Graph Coloring
– Wigderson
- 1983
|
|
55
|
A linear programming approach to the cutting-stock problem
– Gilmore, Gomory
- 1961
|
|
55
|
Approximate algorithms for the 0/1 knapsack problem
– Sahni
- 1975
|
|
48
|
Ramsey numbers and an approximation algorithm for the vertex cover problem
– Monien, Speckenmeyer
- 1985
|
|
44
|
Geometry helps in matching
– Vaidya
- 1989
|
|
42
|
A Linear Time Approximation Algorithm for the Weighted Vertex Cover Problem
– Bar-Yehuda, Even
- 1981
|
|
30
|
The NP-completeness of edge coloring
– Holyer
- 1981
|
|
23
|
Approximation Algorithms for Geometric Embeddings in the Plane with Applications to Parallel Processing
– Hansen
- 1989
|
|
22
|
A new polynomial-time algorithm for linear programming
– Karmakar
- 1984
|
|
19
|
Graph Theory with Applications, North-Holland
– Bondy, Murty
- 1976
|
|
14
|
Fast geometric approximation techniques and geometric embedding problems
– Bern, Karloff, et al.
- 1989
|
|
12
|
An efficient approximation scheme for variablesized bin packing
– Murgolo
- 1987
|
|
11
|
Approximate minimum weight matching on points in k-dimensional space, Algorithmica
– Vaidya
- 1990
|
|
10
|
Bin Packing can be solved within 1
– Vega, Lueker
- 1981
|
|
8
|
On Approximating a Vertex Cover for Planar Graphs
– Bar-Yehuda, Even
- 1982
|
|
8
|
General Techniques for Combinatorial Approximation
– Sahni
- 1977
|
|
7
|
On the existence of fast approximation schemes
– Korte, Schrader
- 1980
|
|
6
|
The fast approximate solution of hard combinatorial problems
– Karp
- 1975
|
|
6
|
On the Ratio of Optimal Integral and Fractional
– Lov'asz
- 1975
|
|
6
|
On the Ratio of Optimal Integral
– Lov'asz
- 1975
|
|
3
|
A Simple Probabilistic Approximation Algorithm for Vertex Cover
– Pitt
- 1985
|
|
3
|
Approximative Combinatorial Algorithms
– Kannan, Korte
- 1984
|
|
2
|
Complexity of the approximate solution of combinatorial problems
– Nigmatullin
- 1975
|
|
1
|
Optima of dual integer programs
– Aharoni, Erdos, et al.
- 1988
|
|
