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

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

Volumn 2906, Issue , 2003, Pages 148-157

  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

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; FORESTRY; SET THEORY; TREES (MATHEMATICS);

AMORTIZED ANALYSIS; EXACT ALGORITHMS; MAXIMUM INDEPENDENT SETS; PARAMETERIZED; RUNNING TIME; SIMPLE ALGORITHM; VERTEX COVER PROBLEMS; WORST CASE SCENARIO;

ALGORITHMS;

ALGORITHMS; PROBLEM SOLVING;

EID: 35248836530     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24587-2_17     Document Type: Article

References (20)

1. R. BALASUBRAMANIAN, M. R. FELLOWS, AND V. RAMAN, An improved fixed parameter algorithm for vertex cover, Inform. Process. Lett. 65, (1998), pp. 163-168.
2. R. BEIGEL, Finding maximum independent sets in sparse and general graphs, in Proc. 10th ACM-SIAM Symp. on Discrete Algorithms (SODA'99), (1999), pp. 856-857.
3. J. F. BUSS AND J. GOLDSMITH, Nondeterminism within P, SIAM J. Comput. 22, (1993), pp. 560-572.
4. ∼cai/.
5. J. CHEN, I. A. KANJ, AND W. JIA, Vertex cover: further observations and further improvements, J. Algorithms 41, (2001), pp. 280-301.
6. J. CHEN, L. LIU, AND W. JIA, Improvement on vertex cover for low-degree graphs, Networks 35, (2000), pp. 253-259.
7. DIMACS Workshop on Faster Exact Algorithms for NP-hard problems, Princeton, NJ, (2000).
8. R. DOWNEY AND M. FELLOWS, Parameterized computational feasibility, in Feasible Mathematics II, P. Clote and J. Remmel, eds., Boston, Birkhäuser (1995), pp. 219-244.
9. R. DOWNEY AND M. FELLOWS, Parameterized Complexity, New York, Springer, (1999).
10. P. HANSEN AND B. JAUMARD, Algorithms for the maximum satisfiability problem, Computing 44, (1990) pp. 279-303.
11. R. IMPAGLIAZZO, R. PATURI, AND F. ZANE, Which problems have strongly exponential complexity?, J. Comput. System Sci. 63-4, (2001), pp. 512-530.
12. 0.304n) algorithm for solving the maximum independent set problem, IEEE Trans. Comput. 35, (1986) pp. 847-851.
13. D. JOHNSON AND M. SZEGEDY, What are the least tractable instances of max. independent set?, Proc. 10th ACM-SIAM Symp. on Discrete Algorithms, (1999), pp. 927-928.
14. 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, AMS, Providence, RI, (1996).
15. I. A. KANJ, Vertex Cover: Exact and Approximate Algorithms and Applications, Ph.D. Dissertation, Dept. of Computer Science, Texas A&M University, College Station, Texas, (2001).
16. R. NIEDERMEIER AND P. ROSSMANITH, Upper bounds for vertex cover further improved, Lecture Notes in Computer Science 1563, (1999), pp. 561-570.
17. R. NIEDERMEIER AND P. ROSSMANITH, A general method to speed up fixed-parameter-tractable algorithms, Inform. Process. Lett. 73, (2000), pp. 125-129.
18. J. M. ROBSON, Algorithms for maximum independent set, J. Algorithms 6, (1977), pp. 425-440.
19. 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.
20. R. E. TARJAN AND A. E. TROJANOWSKI, Finding a maximum independent set, SIAM J. Comput. 7, (1986), pp. 537-546.