Enumerate and expand: New runtime bounds for vertex cover variants

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

Volumn 4112 LNCS, Issue , 2006, Pages 265-273

  Mölle, Daniel ^a   Richter, Stefan ^a   Rossmanith, Peter ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GEOMETRY; COMPUTATIONAL METHODS; GRAPH THEORY; GRAPHIC METHODS; INVERSE PROBLEMS; PROBLEM SOLVING;

RUNTIME; VERTEX COVER VARIANTS;

COMPUTATIONAL COMPLEXITY;

EID: 33749563888     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11809678_29     Document Type: Conference Paper

References (17)

1. R. Balasubramanian, M. R. Fellows, and V. Raman. An improved fixed parameter algorithm for vertex cover. Information Processing Letters, 65(3): 163-168, 1998.
2. L. S. Chandran and F. Grandoni. Refined memorization for vertex cover. Information Processing Letters, 93:125-131, 2005.
3. J. Chen, I. A. Kanj, and W. Jia. Vertex cover: Further observations and further improvements. Journal of Algorithms, 41:280-301, 2001.
4. J. Chen, I. A. Kanj, and G. Xia. Simplicity is beauty: Improved upper bounds for vertex cover. Technical Report TR05-008, School of CTI, DePaul University, 2005.
5. S. E. Dreyfus and R. A. Wagner. The Steiner problem in graphs. Networks, 1:195-207, 1972.
6. H. Fernau. On parameterized enumeration. In Proc. of 8th COCOON, number 2387 in LNCS, pages 564-573. Springer, 2002.
7. H. Fernau. Parameterized Algorithmics: A Graph-Theoretic Approach. Habilitation thesis, Universität Tübingen, 2005.
8. H. Fernau and D. F. Manlove. Vertex and edge covers with clustering properties: Complexity and algorithms. Technical Report TR-2006-210, Dept of Computing Science, University of Glasgow, Apr. 2006.
9. F. V. Fomin, F. Grandoni, and D. Kratsch. Some new techniques in design and analysis of exact (exponential) algorithms. EATCS Bulletin, 87:47-77, 2005.
10. F. V. Fomin and K. Høie. Pathwidth of cubic graphs and exact algorithms. Technical Report 298, Department of Informatics, University of Bergen, May 2005.
11. B. Fuchs, W. Kern, D. Mölle, S. Richter, P. Rossmanith, and X. Wang. Dynamic programming for minimum steiner trees. Theory of Computing Systems, 2006. To appear.
12. D. Mölle, S. Richter, and P. Rossmanith. Enumerate and expand: Improved algorithms for connected vertex cover and tree cover. 2006. To appear in Proc. of 1st CSR.
13. D. Mölle, S. Richter, and P. Rossmanith. A faster algorithm for the Steiner tree problem. In Proc. of 23rd STAGS, number 3884 in LNCS, pages 561-570. Springer, 2006.
14. R. Niedermeier. Invitation to fixed-parameter algorithms. Habilitation thesis, Universität Tübingen, 2002.
15. R. Niedermeier and P. Rossmanith. Upper bounds for Vertex Cover further improved. In Proc. of 16th STACS, number 1563 in LNCS, pages 561-570. Springer, 1999.
16. R. Niedermeier and P. Rossmanith. On efficient fixed parameter algorithms for Weighted Vertex Cover. Journal of Algorithms, 47:63-77, 2003.
17. J. A. Telle and A. Proskurowski. Algorithms for vertex partitioning problems on partial k-trees. SIAM Journal on Discrete Mathematics, 10(4):529-550, 1997.