Improved non-approximability results for minimum vertex cover with density constraints

Theoretical Computer Science

Volumn 225, Issue 1-2, 1999, Pages 113-128

  Clementi, Andrea E F ^a   Trevisan, Luca ^b  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

^b NONE

Author keywords

Approximation algorithms; Computational complexity; Expander graphs; Vertex cover

Indexed keywords

EID: 0003564292     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(97)00226-0     Document Type: Article

References (33)

1. N. Alon, U. Feige, A. Wigderson, D. Zuckerman, Derandomized graph products, Comput. Complexity 5 (1995) 60-75.
2. A. Andreev, A. Clementi, J. Rolim, Constructing the highest degree subgraph for dense graphs is in NCAS, Theoret. Comput. Sci., 1995, to appear.
3. S. Arora, D. Karger, M. Karpinski, Polynomial time approximation schemes for dense instances of NP-hard problems, in: Proc. 27th ACM Symp. on Theory of Comput., 1995, pp. 284-293.
4. S. Arora, C. Lund, R. Motwani, M. Sudan, M. Szegedy, Proof verification and hardness of approximation problems, in: Proc. 33rd IEEE Symp. on Foundations of Computer Science, 1992, pp. 14-23.
5. S. Arora, S. Safra, Probabilistic checking of proofs; a new characterization of NP, in: Proc. 33rd IEEE Symp. on Foundations of Computer Science, 1992, pp. 2-13.
6. M. Bellare, O. Goldreich, M. Sudan, Free bits, PCP's and non-approximability - towards tight results (4th version), Tech. Report TR95-24, Electronic Colloq. on Computational Complexity, 1996, Preliminary version in Proc. FOCS'95.
7. M. Bellare, S. Goldwasser, C. Lund, A. Russell, Efficient probabilistically checkable proofs and applications to approximation, in: Proc. 25th ACM Symp. on Theory of Computing, 1993, pp. 294-304, see also the errata sheet in Proc. STOC'94.
8. M. Bellare, M. Sudan, Improved non-approximability results, in: Proc. 26th ACM Symp. on Theory of Computing, 1994, pp. 184-193.
9. M. Bern, P. Plassmann, The Steiner tree problem with edge lengths 1 and 2, Inform. Proc. Lett. 32 (1989) 171-176.
10. P. Crescenzi, A. Panconesi, Completeness in approximation classes, Inform. Comput. 93 (1991) 241-262. Preliminary version in Proc. FCT'89.
11. P. Crescenzi, R. Silvestri, L. Trevisan, To weight or not to weight: where is the question? in: Proc. 4th IEEE Israel Symp. on Theory of Computing and Systems, 1996, pp. 68-77.
12. P. Crescenzi, L. Trevisan, On approximation scheme preserving reducibility and its applications, in: Proc. 14th Conf. on Foundations of Software Technology and Theoretical Computer Science, Lecture Notes in Computer Science, vol. 880, Springer, Berlin, 1994, pp. 330-341.
13. U. Feige, A threshold of 1n n for approximating set cover, in: Proc. 28th ACM Symp. on Theory of Computing, 1996, pp. 314-318.
14. U. Feige, S. Goldwasser, L. Lovász, S. Safra, M. Szegedy, Approximating clique is almost NP-complete, in: Proc. 32nd IEEE Symp. on Foundations of Computer Science, 1991, pp. 2-12.
15. U. Feige, J. Kilian, Two prover protocols - low error at affordable rates, in: Proc. 26th ACM Symp. on Theory of Computing, 1994, pp. 172-183.
16. O. Gabber, Z. Galil, Explicit construction of linear sized superconcentrators, J. Comput. System Sci. 22 (1981) 407-425.
17. M.R. Garey, D.S. Johnson, L. Stockmeyer, Some simplified NP-complete graph problems, Theoret. Comput. Sci. 1 (1976) 237-267.
18. M.R. Garey, D.S. Johnson, Computers and Intractability: a Guide to the Theory of NP-Completeness, Freeman, New York, 1979.
19. F. Gavril, Manuscript, 1974, cited in [18].
20. 1-ε, in: Proc. 37th IEEE Symp. on Foundations of Computer Science, 1996, pp. 627-636.
21. J. Håstad, Testing of the long code and hardness for clique, in: Proc. 28th ACM Symp. on Theory of Computing, 1996, pp. 11-19.
22. J. Håstad, Some optimal inapproximability results, in: Proc. 29th ACM Symp. on Theory of Computing, 1997, pp. 1-10.
23. T. Jiang, M. Li, On the approximation of shortest common supersequences and longest common subsequences, in: Proc. 21st Internat. Colloq. on Automata, Languages and Programming, Lecture Notes in Computer Science, vol. 820, Springer, Berlin, 1994, pp. 191-202.
24. R.M. Karp, Reducibility among combinatorial problems, in: R.E. Miller, J.W. Thatcher (Eds.), Complexity of Computer Computations, Plenum Press, New York, 1972, pp. 85-103.
25. S. Khanna, R. Motwani, M. Sudan, U. Vazirani, On syntactic versus computational views of approximability, in: Proc. 35th IEEE Symp. on Foundations of Computer Science, 1994, pp. 819-830.
26. A. Lubotzky, R. Phillips, P. Sarnak, Ramanujan graphs, Combinatorica 8 (1988) 261-277.
27. C. Lund, M. Yannakakis, On the hardness of approximating minimization problems, J. ACM 41 (1994) 960-981. Preliminary version in Proc. STOC'93.
28. B. Monien, E. Speckenmeyer, Some further approximation algorithms for the vertex cover problem, in: Proc. of CAAP83, Lecture Notes in Computer Science, vol. 159, Springer, Berlin, 1983, pp. 341-349.
29. R. Motwani, P. Raghavan, Randomized Algorithms, Cambridge University Press, Cambridge, 1995.
30. C.H. Papadimitriou, M. Yannakakis, Optimization, approximation, and complexity classes, J. Comput. System Sci. 43 (1991) 425-440, Preliminary version in Proc. STOC'88.
31. R. Raz, A parallel repetition theorem, in: Proc. 27th ACM Symp. on Theory of Comput., 1995, pp. 447-456.
32. M. Sipser, Expanders, randomness or time vs. space, in: Proc. 1st IEEE Conf. on Structure in Complexity Theory, Springer, Berlin, 1986.
33. L. Trevisan, G.B. Sorkin, M. Sudan, D.P. Williamson, Gadgets, approximation, and linear programming, in: Proc. 37th IEEE Symp. on Foundations of Computer Science, 1996, pp. 617-626.