Polynomial approximation algorithms with performance guarantees: An introduction-by-example

European Journal of Operational Research

Volumn 165, Issue 3, 2005, Pages 555-568

  Demange, Marc ^a   Paschos, Vangelis Th ^b  

^a ESSEC BUSINESS SCHOOL   (France)

^b UNIVERSITÉ PARIS DAUPHINE   (France)

Author keywords

Combinatorial optimization; Complexity theory; Computing science; Traveling salesman

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE; OPTIMIZATION; PERFORMANCE; TRAVELING SALESMAN PROBLEM;

COMBINATORIAL OPTIMIZATION; COMPLEXITY THEORY; COMPUTING SCIENCE; NP-OPTIMIZATION (NPO) PROBLEM;

POLYNOMIAL APPROXIMATION;

EID: 13444263504     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2004.03.021     Document Type: Article

References (32)

1. S. Arora, Polynomial time approximation schemes for Euclidean TSP and other geometric problems, in: Proc. FOCS'96, 1996, pp. 2-11
2. Arora S., Karger D., Karpinski M. Polynomial time approximation schemes for dense instances of NP-hard problems. Journal of Computer and System Sciences. 58:1999;193-210
3. Arora S., Lund C. Hardness of approximation. Hochbaum D.S. Approximation Algorithms for NP-hard Problems. 1997;399-446 PWS, Boston. Chapter 10
4. Arora S., Lund C., Motwani R., Sudan M., Szegedy M. Proof verification and intractability of approximation problems. Journal of the Association for Computing Machinery. 45(3):1998;501-555
5. Ausiello G., Crescenzi P., Gambosi G., Kann V., Marchetti-Spaccamela A., Protasi M. Complexity and Approximation. Combinatorial Optimization Problems and their Approximability Properties. 1999;Springer, Berlin
6. Bar-Yehuda R., Even S. A local-ratio theorem for approximating the weighted vertex cover problem. Annals of Discrete Applied Mathematics. 25:1985;27-46
7. Berge C. Graphs and Hypergraphs. 1973;North Holland, Amsterdam
8. Boppana B.B., Halldórsson M.M. Approximating maximum independent sets by excluding subgraphs. BIT. 32(2):1992;180-196
9. N. Christofides, Worst-case analysis of a new heuristic for the traveling salesman problem, Technical Report 388, Grad. School of Industrial Administration, CMU, 1976
10. Chvátal V. A greedy-heuristic for the set covering problem. Mathematics of Operations Research. 4:1979;233-235
11. Cornuejols G., Nemhauser G.L. Tight bounds for Christofides' traveling salesman heuristic. Mathematical Programming. 14:1978;116-121
12. P. Crescenzi, A short guide to approximation preserving reductions, in: Proceedings of the Conference on Computational Complexity, 1997, pp. 262-273
13. Demange M., Paschos V.Th. Improved approximations for maximum independent set via approximation chains. Applied Mathematics Letters. 10(3):1997;105-110
14. M. Demange, V.Th. Paschos, Towards a general formal framework for polynomial approximation, Cahier du LAMSADE 177, LAMSADE, Université Paris-Dauphine, 2001
15. L. Engebretsen, M. Karpinski, Approximation hardness of TSP with bounded metrics, in: Proc. ICALP'01, Lecture Notes in Computer Science, vol. 2076, Springer, 2001, pp. 201-212
16. Garey M.R., Johnson D.S. Computers and Intractability. A Guide to the Theory of NP-completeness. 1979;W.H. Freeman, San Francisco
17. Halldórsson M.M. Approximations of weighted independent set and hereditary subset problems. Journal of Graph Algorithms and Applications. 4(1):2000;1-16
18. Hochbaum D.S. Approximation Algorithms for NP-hard Problems. 1997;PWS, Boston
19. Johnson D.S. Approximation algorithms for combinatorial problems. Journal of Computer and System Sciences. 9:1974;256-278
20. Johnson D.S., Demers A., Ullman J.D., Garey M.R., Graham R.L. Worst-case performance bounds for simple one-dimensional packing algorithms. SIAM Journal of Computing. 3(4):1974;298-325
21. Karpinski M. Polynomial time approximation schemes for some dense instances of NP-hard problems. Algorithmica. 30:2001;386-397
22. Lawler E.L. Combinatorial Optimization: Networks and Matroids. 1976;Holt, Rinehart and Winston, New York
23. Lovász L. On the ratio of optimal integral and fractional covers. Discrete Mathematics. 13:1975;383-390
24. Monien B., Speckenmeyer E. Ramsey numbers and an approximation algorithm for the vertex cover problem. Acta Informatica. 22:1985;115-123
25. Papadimitriou C.H., Steiglitz K. Combinatorial Optimization: Algorithms and Complexity. 1981;Prentice Hall, New Jersey
26. C.H. Papadimitriou, S. Vempala, On the approximability of the traveling salesman problem, in: Proc. STOC'00, 2000, pp. 126-133
27. Papadimitriou C.H., Yannakakis M. Optimization, approximation and complexity classes. Journal of Computer and System Sciences. 43:1991;425-440
28. Papadimitriou C.H., Yannakakis M. The traveling salesman problem with distances one and two. Mathematics of Operation Research. 18:1993;1-11
29. R. Raz, S. Safra, A sub-constant error probability low-degree test and a sub-constant error probability PCP characterization of NP, in: Proc. STOC'97, 1997, pp. 475-484
30. Sahni S., Gonzalez T. P-complete approximation problems. Journal of the Association for Computing Machinery. 23:1976;555-565
31. P. Slavík, A tight analysis of the greedy algorithm for set cover, in: Proc. STOC'96, 1996, pp. 435-441
32. Vazirani V. Approximation Algorithms. 2001;Springer, Berlin