A general method to speed up fixed-parameter-tractable algorithms

Information Processing Letters

Volumn 73, Issue 3-4, 2000, Pages 125-129

  Niedermeier, Rolf ^a   Rossmanith, Peter ^b  

^a UNIVERSITY OF TÜBINGEN   (Germany)

^b TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

Algorithms; Parameterized complexity

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; PROBLEM SOLVING; TREES (MATHEMATICS);

FIXED-PARAMETER-TRACTABLE (FPT) ALGORITHMS;

SET THEORY;

EID: 0033874612     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(00)00004-1     Document Type: Article

References (12)

1. R. Balasubramanian, M.R. Fellows, V. Raman, An improved fixed parameter algorithm for vertex cover, Inform. Process. Lett. 65 (3) (1998) 163-168.
2. L. Cai, J. Chen, R.G. Downey, M.R. Fellows, Advice classes of parameterized tractability, Ann. Pure Appl. Logic 84 (1997) 119-138.
3. J. Chen, I. Kanj, W. Jia, Vertex cover: Further observations and further improvements, in: Proc. 25th International Workshop on Graph-Theoretic Concepts in Computer Science, Ascona, Switzerland, Lecture Notes in Computer Sci., Springer, Berlin, 1999.
4. R.G. Downey, M.R. Fellows, Parameterized computational feasibility, in: P. Clote, J. Remmel (Eds.), Feasible Mathematics II, Birkhäuser, Boston, MA, 1995, pp. 219-244.
5. R.G. Downey, M.R. Fellows, Parameterized Complexity, Springer, Berlin, 1999.
6. R.G. Downey, M.R. Fellows, U. Stege, Parameterized Complexity: A Framework for Systematically Confronting Computational Intractability, in: R.L. Graham, Kratochvi, J. Nesetril, F.S. Roberts (Eds.), Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA to the Future, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 49, AMS, Providence, RI, 1999, pp. 49-100.
7. H. Fernau, R. Niedermeier, An efficient exact algorithm for constraint bipartite vertex cover, in: Proc. 24th Conference on Mathematical Foundations of Computer Science, Szklarsk Poreba, Poland, Lecture Notes in Computer Sci., Vol. 1672, Springer, Berlin, 1999, pp. 387-397.
8. D.H. Greene, D.E. Knuth, Mathematics for the Analysis of Algorithms, 2nd edn., Progress in Computer Science, Birkhäuser, Boston, MA, 1982.
9. R. Niedermeier, Some prospects for efficient fixed parameter algorithms (Invited Paper), in: B. Rovan (Ed.), Proc. 25th Conference on Current Trends in Theory and Practice of Informatics (SOFSEM), Lecture Notes in Computer Sci., Vol. 1521, Springer, Berlin, 1998, pp. 168-185.
10. R. Niedermeier, P. Rossmanith, An efficient fixed parameter algorithm for 3-Hitting Set, Technical Report WSI-99-18, WSI für Informatik, Universität Tübingen, Germany, 1999.
11. R. Niedermeier, P. Rossmanith, Upper bounds for Vertex Cover further improved, in: C. Meinel, S. Tison (Eds.), Proc. 16th Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Computer Sci., Vol. 1563, Springer, Berlin, 1999, pp. 561-570.
12. U. Stege, M. Fellows, An improved fixed-parameter-tractable algorithm for Vertex Cover, Technical Report 318, Department of Computer Science, ETH Zürich, April 1999.