Lecture Notes on Approximation Algorithms -- Volume I

Lecture Notes on Approximation Algorithms -- Volume I (1992)

Cached

Download Links

by Rajeev Motwani

Citations:

BibTeX

@MISC{Motwani92lecturenotes,
    author = {Rajeev Motwani},
    title = {Lecture Notes on Approximation Algorithms -- Volume I},
    year = {1992}
}

Bookmark

OpenURL

Abstract

Citations

8882	Computers and Intractability: A Guide to the Theory of NPCompleteness. W.H - Garey, Johnson - 1979
1232	Theory of Linear and Integer Programming - SCHRIJVER - 1986
1055	Combinatorial Optimization: Algorithms and Complexity - Papadimitriou, Steiglitz - 1982
969	Geometric Algorithms and Combinatorial Optimization - Grötschel, Lovász, et al. - 1993
577	Approximation algorithms for combinatorial problems - Johnson - 1974
387	Combinatory Optimization: Networks and Matroids - Lawler - 1976
303	A greedy heuristic for the set-covering problem - Chvatal - 1979
284	The ellipsoid method and its consequences in combinatorial optimization - GRÖTSCHEL, LOVÁSZ, et al. - 1981
272	Bounds for certain multiprocessing anomalies - Graham - 1966
237	D.B.: Sequencing and Scheduling: Algorithms and Complexity - Lawler, Lenstra, et al. - 1993
224	Every planar map is four-colorable - Appel, Haken - 1976
221	Worst-Case Analysis of a New Heuristic for the Traveling Salesman Problem - Christofides - 1976
220	P-complete approximation problems - Sahni, Gonzalez - 1976
185	Integer programming with a fixed number of variables - Lenstra - 1983
164	The NP-completeness column: an ongoing guide - Johnson - 1982
158	C.E.Kim, Fast approximation algorithms for the knapsack and sum of subset problems - Ibarra - 1975
147	A local-ratio theorem for approximating the weighted vertex cover problem - Bar-Yehuda, Even
141	Applications of a planar separator theorem - Lipton, Tarjan - 1980
110	An Analysis of Several Heuristics for the Traveling Salesman Problem - Rosenkrantz, Strearns, et al. - 1977
107	Approximation Algorithms For Set Covering And Vertex Cover Problem - Hochbaum - 1982
102	Worstcase performance bounds for simple one-dimensional packing algorithms - Johnson, Demers, et al. - 1974
100	An efficient approximation scheme for the one-dimensional bin-packing problem - Karmarkar, Karp - 1982
88	Approximation algorithms for bin packing { an updated survey - Coman, Garey, et al. - 1984
77	Strong NP-completeness results: motivation, examples and implications - Garey, Johnson - 1978
76	Fast approximation algorithms for the knapsack problems - Lawler - 1979
67	A linear programming approach to the cutting-stock problem. Operations research - Gilmore, Gomory - 1961
66	Efficient bounds for the stable set, vertex cover and set packing problems - Hochbaum - 1983
62	Approximate algorithms for the 0/1 knapsack problem - Sahni - 1975
61	Improving the Performance Guarantee of Approximate Graph Coloring - WIGDERSON - 1983
56	A Linear Time Approximation Algorithm For The Weighted Vertex Cover Problem - Yehuda, Even - 1981
52	Ramsey numbers and an approximation algorithm for the vertex cover problem - Monien, Speckenmeyer
50	Geometry helps in Matching - Vaidya - 1989
35	The NP-completeness of edge coloring - Holyer
22	A new polynomial-time algorithm for linear programming - Karmakar - 1984
21	Approximate algorithms for geometric embeddings in the plane with applications parallel processing problems - Hansen - 1989
20	Graph Theory with Applications. North Holland - Bondy, Murty - 1976
16	An efficient approximation scheme for variable-sized bin packing - Murgolo - 1987
14	General techniques for combinatorial approximation - Sahni - 1977
13	Fast geometric approximation techniques and geometric embedding problems - Bern, Karlo - 1992
11	Bin Packing can be Solved Within 1 - Vega, Lueker - 1981
10	On the existence of fast approximation schemes - Korte, Schrader - 1981
10	Approximate minimum weight matching on points in k-dimensional space - Vaidya - 1989
9	On approximating a vertex cover for planar graphs - Bar-Yehuda, Even - 1982
7	On the Ratio of Optimal Integral and - Lovasz - 1975
6	On the Ratio of Optimal Integral and Fractional - Lovasz - 1975
6	A simple probabilistic approximation algorithm for vertex cover - Pitt - 1985
5	The fast approximate solution of hard combinatorial problems - Karp - 1975
5	Approximative combinatorial algorithms - Kannan, Korte - 1984
2	A modification of the greedy algorithm for vertex - Clarkson - 1983
2	Complexity of the approximate solution of combinatorial problems - Nigmatullin - 1975