Recognizing when heuristics can approximate minimum vertex covers is complete for parallel access to NP

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2573 LNCS, Issue , 2002, Pages 258-269

  Hemaspaandra, Edith ^a   Rothe, Jörg ^b   Spakowski, Holger ^b  

^a Rochester Institute of Technology   (United States)

^b HEINRICH HEINE UNIVERSITY   (Germany)

Author keywords

Approximation; Completeness; Computational complexity; Minimum vertex cover heuristics; Parallel access to NP

Indexed keywords

APPROXIMATION ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE; GRAPH THEORY; PROBLEM SOLVING;

APPROXIMATION; COMPLETENESS; CONSTANT FACTORS; GREEDY HEURISTICS; MINIMUM VERTEX COVER; OPTIMAL SOLUTIONS; PARALLEL ACCESS TO NP; VERTEX COVER PROBLEMS;

PROBLEM SOLVING; GRAPH THEORY;

EID: 33750274093     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (20)

1. H. Bodlaender, D. Thilikos, and K. Yamazaki. It is hard to know when greedy is good for finding independent sets. Information Processing Letters, 61: 101-106, 1997.
2. M. Clausen and A. Fortenbacher. Efficient solution of linear diophantine equations. Journal of Symbolic Computation, 8(1/2): 201-216, 1989.
3. V. Chvátal. A greedy heuristic for the set-covering problem. Mathematics of Operations Research, 4(3): 233-235, 1979.
4. U. Feige. A threshold of ln n for approximating set cover. Journal of the ACM, 45(4): 634-652, July 1998.
5. M. Garey and D. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York, 1979.
6. L. Hemachandra. The strong exponential hierarchy collapses. Journal of Computer and System Sciences, 39(3): 299-322, 1989.
7. E. Hemaspaandra, L. Hemaspaandra, and J. Rothe. Exact analysis of Dodgson elections: Lewis Carroll's 1876 voting system is complete for parallel access to NP. Journal of the ACM, 44(6): 806-825, 1997.
8. E. Hemaspaandra and J. Rothe. Recognizing when greed can approximate maximum independent sets is complete for parallel access to NP. Information Processing Letters, 65(3): 151-156, February 1998.
9. E. Hemaspaandra, J. Rothe, and H. Spakowski. Recognizing when heuristics can approximate minimum vertex covers is complete for parallel access to NP. Technical Report cs.CC/0110025, Computing Research Repository (CoRR), October 2001. 16 pages. Available on-line at http: //xxx.lanl.gov/abs/cs.CC/0110025.
10. D. Johnson. Approximation algorithms for combinatorial problems. Journal of Computer and System Sciences, 9(3): 256-278, 1974.
11. M. Krentel. The complexity of optimization problems. Journal of Computer and System Sciences, 36: 490-509, 1988.
12. J. Köbler, U. Schöning, and K. Wagner. The difference and truth-table hierarchies for NP. R.A.I.R.O. Informatique théorique et Applications, 21: 419-435, 1987.
13. L. Lovász. On the ratio of optimal integral and fractional covers. Discrete Mathematics, 13: 383-390, 1975.
14. C. Lund and M. Yannakakis. On the hardness of approximating minimization problems. Journal of the ACM, 41(5): 960-981, September 1994.
15. C. Papadimitriou. Computational Complexity. Addison-Wesley, 1994.
16. C. Papadimitriou and K. Steiglitz. Combinatorial Optimization: Algorithms and Complexity. Prentice-Hall, 1982.
17. C. Papadimitriou and S. Zachos. Two remarks on the power of counting. In Proceedings of the 6th GI Conference on Theoretical Computer Science, pages 269-276. Springer-Verlag Lecture Notes in Computer Science #145, 1983.
18. H. Spakowski and J. Vogel. Θ2p-completeness: A classical approach for new results. In Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science, pages 348-360. Springer-Verlag Lecture Notes in Computer Science #1974, December 2000.
19. K. Wagner. More complicated questions about maxima and minima, and some closures of NP. Theoretical Computer Science, 51: 53-80, 1987.
20. K. Wagner. Bounded query classes. SIAM Journal on Computing, 19(5): 833-846, 1990.