Either/or: Using vertex cover structure in designing FPT-algorithms - The case of k-internal spanning tree

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

Volumn 2748, Issue , 2003, Pages 474-483

  Prieto, Elena ^a   Sloper, Christian ^b  

^a UNIVERSITY OF NEWCASTLE   (Australia)

^b UNIVERSITY OF BERGEN   (Norway)

Author keywords

Fixed parameter tractability; Kernelization; Spanning trees; Vertex cover

Indexed keywords

ALGORITHMS; POLYNOMIAL APPROXIMATION; TELECOMMUNICATION NETWORKS;

DESIGN TECHNIQUE; DOMINATING SET PROBLEMS; FIXED-PARAMETER TRACTABILITY; FPT ALGORITHMS; KERNELIZATION; POLYNOMIAL-TIME ALGORITHMS; SPANNING TREE; VERTEX COVER;

TREES (MATHEMATICS);

EID: 35048859082     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45078-8_41     Document Type: Article

References (24)

1. F. Abu-Khzam. Private communication.
2. J. Alber and R. Niedermeier. Improved tree decomposition based algorithms for domination-like problems. Proceedings of the 5th Latin American Theoretical INformatics (LATIN 2002), number 2286 in Lecture Notes in Computer Science, pages 613-627, Springer (2002).
3. R. Balasubramanian, M. R. Fellows, and V. Raman. An Improved Fixed Parameter Algorithm for Vertex Cover. Information Processing Letters 65:3 (1998), 163-168.
4. B. Chor, M. Fellows, D. Juedes. Private communication concerning manuscript in preparation.
5. Liming Cai, J. Chen, R. Downey and M. Fellows. The parameterized complexity of short computation and factorization. Archive for Mathematical Logic 36 (1997), 321-338.
6. J. Chen, I. Kanj, and W. Jia. Vertex cover: Further Observations and Further Improvements. Journal of Algorithms Volume 41, 280-301 (2001).
7. T.H. Cormen, C.E. Leierson, R.L. Rivest, Introduction to Algorithms, MIT Press.
8. R. Downey and M. Fellows. Parameterized Computational Feasibility. P. Clote, J. Remmel (eds.): Feasible Mathematics II Boston: Birkhauser (1995), 219-244.
9. R. Downey and M. Fellows. Fixed-parameter tractability and completeness II: completeness for W[1]. Theoretical Computer Science A 141 (1995), 109-131.
10. R. Downey and M. Fellows. Parameterized Complexity Springer-Verlag (1998).
11. R. Downey, M. Fellows and U. Stege. Parameterized complexity: a framework for systematically confronting computational intractability. Contemporary Trends in Discrete Mathematics (R. Graham, J. Kratochvil, J. Nesetril and F. Roberts, eds.), AMS-DIMACS Series in Discrete Mathematics and Theoretical Computer Science 49 (1999), 49-99.
12. A. Faisal, M. Fellows, M. Langston, F. Rosamond. Private communication concerning manuscript in preparation.
13. M. Fellows, C. McCartin. F. Rosamond and U. Stege. Spanning Trees with Few and Many Leaves. To appear
14. G. Galbiati, F. Maffioli, and A. Morzenti. A Short Note on the Approximability of the Maximum Leaves Spanning Tree Problem. Information Processing Letters 52 (1994), 45-49.
15. G. Galbiati, A. Morzenti and F. Maffioli. On the Approximability of some Maximum Spanning Tree Problems. Theoretical Computer Science 181 (1997), 107-118.
16. M. Garey and D. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, San Francisco, 1979.
17. Subhash Khot and Venkatesh Raman. Parameterized Complexity of Finding Hereditary Properties. Proceedings of COCOON. Theoretical Computer Science (CO-COON 2000 special issue)
18. M. Langston. Private communication.
19. H.-I. Lu and R. Ravi. Approximating Maximum Leaf Spanning Trees in Almost Linear Time. Journal of Algorithms 29 (1998), 132-141.
20. Catherine McCartin. Ph.D. dissertation in Computer Science, Victoria University, Wellington, New Zealand, 2003.
21. R. Niedermeier and P. Rossmanith. Upper Bounds for Vertex Cover Further Improved. In C. Meinel and S. Tison, editors, Proceedings of the 16th Symposium on Theoretical Aspects of Computer Science, number 1563 in Lecture Notes in Computer Science, Springer-Verlag (1999), 561-570
22. J.A. Telle and A. Proskurowski. Practical algorithms on partial k-trees with an application to domination-like problems. Proceedings WADS'93 - Third Workshop on Algorithms and Data Structures. Springer Verlag, Lecture Notes in Computer Science vol.709 (1993) 610-621.
23. N. Robertson, PD. Seymor. Graph Minors. XX Wagner's conjecture. To appear.
24. Ulrike Stege. Ph.D. dissertation in Computer Science, ETH, Zurich, Switzerland, 2000.