Labeled search trees and amortized analysis: Improved upper bounds for NP-hard problems

Algorithmica (New York)

Volumn 43, Issue 4, 2005, Pages 245-273

  Chen, Jianer ^a   Kanj, Iyad A ^b   Xia, Ge ^a  

^a TEXAS A AND M UNIVERSITY   (United States)

^b DEPAUL UNIVERSITY   (United States)

Author keywords

Exact algorithm; Independent set; Parameterized algorithm; Vertex cover

Indexed keywords

ALGORITHMS; GRAPH THEORY; PROBLEM SOLVING;

EXACT ALGORITHM; INDEPENDENT SET; VERTEX COVER;

TREES (MATHEMATICS);

EID: 29544442307     PISSN: 01784617     EISSN: 14320541     Source Type: Journal    
DOI: 10.1007/s00453-004-1145-7     Document Type: Article

References (24)

1. A. V. Aho, J. E. Hopcroft, and J. D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974.
2. R. Balasubramanian, M. R. Fellows, and V. Raman, An improved fixed parameter algorithm for vertex cover, Information Processing Letters 65 (1998), 163-168.
3. R. Beigel, Finding maximum independent sets in sparse and general graphs, in Proceedings of the 10th ACM-SIAM Symposium on Discrete Algorithms (SODA '99) (1999), pp. 856-857.
4. J. F. Buss and J. Goldsmith, Nondeterminism within P. SIAM Journal on Computing 22 (1993), 560-572.
5. L. Cai and D. Juedes, On the existence of subexponential-time parameterized algorithms, Journal of Computer and System Sciences 67(4) (2003), 789-807.
6. J. Chen, I. A. Kanj, and W. Jia, Vertex cover: further observations and further improvements, Journal of Algorithms 41 (2001), 280-301.
7. J. CHEN, L. LIU, AND W. JIA, Improvement on Vertex Cover for low-degree graphs, Networks 35 (2000), 253-259.
8. DIMACS Workshop on Faster Exact Algorithms for NP-Hard Problems, Princeton, NJ (2000).
9. R. Downey and M. Fellows, Parameterized computational feasibility, in Feasible Mathematics II, P. Clote and J. Remmel, eds., Birkhaüser, Boston, MA, 1995, pp. 219-244.
10. R. Downey and M. Fellows, Parameterized Complexity, Springer, New York, 1999.
11. P. Hansen and B. Jaumard, Algorithms for the maximum satisfiability problem, Computing 44 (1990), 279-303.
12. R. Impagliazzo, R. Paturi, and F. Zane, Which problems have strongly exponential complexity?, Journal of Computer and System Sciences 63(4) (2001), 512-530.
13. 0.304n) algorithm for solving the maximum independent set problem, IEEE Transactions on Computers 35 (1986), 847-851.
14. D. Johnson and M. Szegedy, What are the least tractable instances of max. independent set?, in Proceedings of the 10th ACM-SIAM Symposium on Discrete Algorithms (SODA '99) (1999), pp. 927-928.
15. D. S. Johnson and M. A. Tricks, Eds., Cliques, Coloring and Satisfiability, Second DIMACS Implementation Challenges, DIMACS Series on Discrete Mathematics and Theoretical Computer Science 26, American Mathematical Society, Providence, RI, 1996.
16. I. A. Kanj, Vertex Cover: Exact and Approximate Algorithms and Applications, Ph.D. Dissertation, Department of Computer Science, Texas A&M University, College Station, TX, 2001.
17. G. L. Nemhauser and L. E. Trotter, Vertex packing: structural properties and algorithms, Mathematical Programming 8 (1975), 232-248.
18. R. Niedermeier and P. Rossmanith, Upper bounds for vertex cover further improved, Lecture Notes in Computer Science 1563, Springer, Berlin, 1999, pp. 561-570.
19. J. M. Robson, Algorithms for maximum independent set, Journal of Algorithms 6 (1977), 425-440.
20. M. Shindo and E. Tomita, A simple algorithm for finding a maximum clique and its worst-case time complexity, Systems and Computers in Japan 21 (1990), 1-13.
21. U. Stege and M. Fellows, An improved fixed-parameter-tractable algorithm for vertex cover, Technical Report 318, Department of Computer Science, ETH Zurich, April 1999.
22. R. E. Tarjan and J. E. Hopcroft, Dividing a graph into triconnected components, SIAM Journal on Computing 2 (1973), 135-158.
23. R. E. Tarjan and A. E. Trojanowski, Finding a maximum independent set, SIAM Journal on Computing 7(1986), 537-546.
24. W. T. Tutte, Graph Theory, Addison-Wesley, Menlo Park, CA, 1984.