Minimum 2SAT-DELETION: Inapproximability results and relations to Minimum Vertex Cover

Discrete Applied Mathematics

Volumn 155, Issue 2, 2007, Pages 172-179

  Chlebík, Miroslav ^a   Chlebíková, Janka ^b  

^a MAX PLANCK INSTITUTE FOR MATHEMATICS IN THE SCIENCES   (Germany)

^b Faculty of Natural Sciences   (Slovakia)

Author keywords

2SAT Deletion; Approximation hardness; Vertex cover

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; NUMBER THEORY; OPTIMIZATION;

2SAT-DELETION; APPROXIMATION ALGORITHMS; APPROXIMATION HARDNESS; VERTEX COVER;

PROBLEM SOLVING;

EID: 33751172296     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2006.04.039     Document Type: Article

References (16)

1. A. Agarwal, M. Charikar, K. Makarychev, Y. Makarychev, Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC), May 2005, Baltimore, MD, USA.
2. Ausiello G., Crescenzi P., Gambosi G., Kann V., Marchetti-Spaccamela A., and Protasi M. Complexity and Approximation (1999), Springer
3. Bar-Yehuda R., and Even S. A local-ratio theorem for approximating the weighted vertex cover problem. Ann. Discrete Math. 25 (1985) 27-46
4. P. Berman, M. Karpinski, Improved approximation lower bounds on small occurrence optimization, ECCC Report TR03-08, 2003.
5. J. Chen, I.A. Kanj, On approximating minimum vertex cover for graphs with perfect matching, Proceedings of the 11st ISAAC, Taipei, Taiwan, Lecture Notes in Computer Science, vol. 1969, Springer, Berlin, 2000, pp. 132-143.
6. Chlebík M., and Chlebíková J. Complexity of approximating bounded variants of optimization problems. Theoret. Comput. Sci. 354 (2006) 320-338
7. I. Dinur, S. Safra, The importance of being biased, Proceedings of the 34th Annual ACM Symposium on Theory of Computing (STOC), May 2002, pp. 33-42, also ECCC Report TR01-104, 2001.
8. Halldórsson M., and Radhakrishnan J. Greed is good: approximating independent sets in sparse and bounded-degree graphs. Algorithmica 18 (1997) 145-163
9. Håstad J. Some optimal inapproximability results. J. ACM 48 (2001) 798-859
10. G. Karakostas, A better approximation ratio for the vertex cover problem, Proceedings of the 32th Annual International Colloquium in Automata, Languages, and Programming (ICALP), 2005.
11. S. Khanna, M. Sudan, L. Trevisan, Constraint satisfaction: the approximability of minimization problems, Proceedings of the 12th Annual IEEE Conference on Computational Complexity, Ulm, Germany, 24-27 June, 1997, pp. 282-296.
12. Klein P., Plotkin S., Rao S., and Tardos E. Approximation algorithms for Steiner and directed multicuts. J. Algorithms 22 2 (1997) 241-269
13. M. Lewin, D. Livnat, U. Zwick, Improved rounding techniques for the MAX-2SAT and MAX DI CUT problems, IPCO 2002, Lecture Notes in Computer Science, vol. 2337, pp. 67-82.
14. Nemhauser G.L., and Trotter L.E. Vertex packings: structural properties and algorithms. Math. Programming 8 (1975) 232-248
15. West D.B. Introduction to Graph Theory (2001), Prentice-Hall, Englewood Cliffs, NJ
16. U. Zwick, Finding almost satisfying assignments, Proceedings of the 30th Annual ACM Symposium on Theory of Computing, 1998, pp. 551-560.