z-Approximations

Journal of Algorithms

Volumn 41, Issue 2, 2001, Pages 429-442

  Hassin, Refael ^a   Khuller, Samir ^b  

^a TEL AVIV UNIVERSITY   (Israel)

^b University of Maryland ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0006490009     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.2001.1187     Document Type: Article

References (38)

1. A. Aiello, E. Burattini, M. Massarotti, and F. Ventriglia, A new evaluation function for approximation algorithm, Sem. IRIA (1977).
2. A. Aiello, E. Burattini, M. Furnari, and F. Ventriglia, Computational complexity: the problem of approximation, in "Algebra, Combinatorics, and Logic in Computer Science," Vol. 1, pp. 51-62, Colloquia Mathematica Societatis János Bolyai 42, North-Holland, New York, 1986.
3. N. Alon and J. H. Spencer, "The Probabilistic Method," Wiley, New York, 1992.
4. G. Ausiello, A. D'Atri, and M. Protasi, Structure preserving reductions among convex optimization problems, J. Comput. System Sci. 21 (1980), 136-153.
5. G. Ausiello, A. Marchetti-Spaccamela, and M. Protasi, Toward a unified approach for the classification of NP-complete optimation problems, Theoret. Comput. Sci. 12 (1980), 83-96.
6. M. Bellare and P. Rogaway, The complexity of approximating a nonlinear program, Math. Programming 69 (1995), 429-441.
7. R. Bar-Yehuda and S. Even, A linear time approximation algorithm for the weighted vertex cover problem, J. Algorithms 2 (1981), 198-203.
8. R. Bar-Yehuda and S. Even, A local ratio theorem for approximating the weighted vertex cover problem, Ann. Discrete Math. 25 (1985), 27-45.
9. B. Berger and P. W. Shor, Approximation algorithms for the maximum acyclic subgraph problem, in "Proceedings of the 1st Annual ACM-SIAM Symposium on Discrete Algorithms," pp. 236-243, 1990.
10. R. Boppana and M. M. Halldórsson, Approximating maximum independent sets by excluding subgraphs, BIT 32 (1992), 180-196.
11. N. Christofides, "Worst-Case Analysis of a New Heuristic for the Traveling Salesman Problem," Technical Report 388, Graduate School of Industrial Administration, Carnegie-Mellon University, 1976.
12. T. H. Cormen, C. E. Leiserson, and R. L. Rivest, "Introduction to Algorithms," MIT Press, Cambridge, MA, 1989.
13. G. Corneujols, M. Fisher, and G. Nemhauser, Location of bank accounts to optimize float: an analytic study of exact and approximate algorithms, Management Sci. 23, No. 8, (1977), 789-810.
14. M. Demange and V. T. Paschos, On an approximation measure founded on the links between optimization and polynomial approximation theory, Theoret. Comput. Sci. 158 (1996), 117-141.
15. M. Demange, P. Grisoni, and V. T. Paschos, Differential approximation algorithms for some combinatorial optimization problems, Theoret. Comput. Sci. 209, Nos. 1 and 2 (1998), 107-122.
16. R. Duh and M. Fürer, Approximation of k-set cover by semi-local optimization, in "Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing," pp. 256-264, 1997.
17. G. N. Frederickson, M. S. Hecht, and C. E. Kim, Approximation algorithms for some routing problems, SIAM J. Comput. 7 (1978), 178-193.
18. M. Goemans and D. Williamson, 0.878 approximation algorithms for MAX-CUT and MAX-2-SAT, in "Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing," pp. 256-264, 1994.
19. L. K. Grover, Local search and the local structure of NP-complete problems, Oper. Res. Lett. 12 (1992), 235-243.
20. G. Gutin and A. Yeo, Polynomial algorithms for the TSP and the QAP with a factorial domination number, manuscript, 1998.
21. 1-∈, in "37th Annual Symposium on Foundations of Computer Science," pp. 627-636, 1996.
22. M. M. Halldórsson, Approximating k-set cover and complementary graph coloring, in "Integer Programming and Combinatorial Optimization Conference," pp. 118-131, Springer-Verlag, 1996.
23. D. Hartvigsen, "Extensions of Matching Theory," Ph.D. thesis, Carnegie-Mellon University, 1984.
24. R. Hassin and S. Lahav, Maximizing the number of unused colors in the vertex coloring problem, Inform. Process. Lett. 52 (1994), 87-90.
25. R. Hassin and S. Rubinstein, Approximation for the maximum acyclic subgraph problem, Inform. Process. Lett. 51 (1994), 133-140.
26. R. Hassin and S. Rubinstein, Better approximations for Max TSP, Inform. Process. Lett. 67, No. 3 (1998), 125-130.
27. D. Hochbaum, Efficient bounds for the stable set, vertex cover, and set packing problems, Discrete Appl. Math. 6 (1983), 243-254.
28. D. S. Hochbaum, Ed., "Approximation Algorithms for NP-Hard Problems." PWS-Kent, Boston, 1996.
29. H. Kise, T. Ibaraki, and H. Mine, Performance analysis of six approximation algorithms for the one-machine maximum lateness scheduling problem with ready times, J. Oper. Res. Soc. Japan 22 (1979), 205-223.
30. R. Kosaraju, J. Park, and C. Stein, Long tours and short superstrings, in "35th Annual Symposium on Foundations of Computer Science," pp. 166-177, 1994.
31. G. L. Nemhauser and L. E. Trotter Jr., Vertex packing: structural properties and algorithms, Math. Programming 8 (1975), 232-248.
32. G. L. Nemhauser and L. A. Wolsey, "Integer and Combinatorial Optimization," Wiley, New York, 1988.
33. A. S. Nemirovsky and D. B. Yudin, "Problem Complexity and Method Efficiency in Optimization," Wiley, Chichester, 1983. [Translated by E. R. Dawson from Slozhnost' Zadach i Effektivnost' Metodov Optimizatsii, 1979.]
34. C. H. Papadimitriou and M. Yannakakis, The traveling salesman problem with distances one and two, Math. Oper. Res. 18, No. 1, (1993), 1-11.
35. S. Sahni and T. Gonzalez, P-complete approximation problems, J. Assoc. Comput. Mach. 23 (1976), 555-565.
36. W. D. Tzeng and G. H. King, Three-quarter approximation for the number of unused colors in graph coloring, Inform. Sci. 114 (1999), 105-126.
37. S. A. Vavasis, Approximation algorithms for indefinite quadratic programming, Math. Programming 57 (1972), 279-311.
38. E. Zemel, Measuring the quality of approximate solutions to zero-one programming problems, Math. Oper. Res. 6 (1981), 319-332.