An O(pn + 1.151p)-algorithm for p-Profit Cover and its practical implications for vertex cover

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

Volumn 2518 LNCS, Issue , 2002, Pages 249-261

  Stege, Ulrike ^a   Van Rooij, Iris ^a   Hertel, Alex ^a   Hertel, Philipp ^a  

^a UNIVERSITY OF VICTORIA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EFFICIENT IMPLEMENTATION; GRAPH G; INTEGER WEIGHTS; MINIMUM VERTEX COVER; TIME COMPLEXITY; VERTEX COVER; FPT ALGORITHMS;

ALGORITHMS; GRAPH THEORY; PROFITABILITY; DECISION MAKING;

COMPUTATIONAL COMPLEXITY; GRAPH THEORY;

EID: 84878662325     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36136-7_23     Document Type: Conference Paper

References (22)

1. J. Alber, J. Gramm, R. Niedermeier, "Faster exact algorithms for hard problems: A parameterized point of view," Discr. Mathematics (2001) 229, 3-27. (Pubitemid 33673569)
2. R. Balasubramanian, M.R. Fellows, and V. Raman, "An improved fixed-parameter algorithm for Vertex Cover". Inform. Proc. Letters (1998) 65, 163-168. (Pubitemid 128392736)
3. J. Chen, I.A. Kanj, W. Jia, "Vertex Cover: Further observations and further improvements," J. Algorithms (2001), 41, 280-301. (Pubitemid 33665542)
4. R.G. Downey and M.R. Fellows, Parameterized Complexity (1999), Springer.
5. R.G. Downey, M.R. Fellows, and U. Stege, "Parameterized Complexity: A Framework for Systematically ConfrontingComputational Intractability," AMS-DIMACS Proc. Series (1999) 49, 49-99.
6. R.G. Downey, M.R. Fellows, and U. Stege, "Computational Tractability: The View From Mars," Bulletin of the EATCS (1999).
7. M.R. Fellows, "On the complexity of vertex set problems," Tech. Rep. (1988), Computer Science Department, University of New Mexico.
8. M.R. Fellows, "Parameterized Complexity: The Main Ideas and Connections To Practical Computing," 1st Dagstuhl Workshop on Exp. Algorithms (2001).
9. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (1979), Freeman.
10. R.L. Graham, D.E. Knuth, and O. Patashnik, Concrete Mathematics, Addison-Wesley (1994).
11. J. Gross and J. Yellen, Graph theory and its applications (1999), CRC Press.
12. R. Hastie, "Problems for judgment and decision making," Ann. Review of Psychology (2001) 52, 653-683. (Pubitemid 33705588)
13. K.I. Manktelow and D.E. Over (Eds.), Rationality: Psychological and philosophical perspectives (1993), London, Routledge.
14. P.K. Moser (Ed.), Rationality in action: Contemporary approaches (1990), Cambridge University Press.
15. G.L. Nemhauser and L.E. Trotter, "Vertex packing: structural properties and algorithms," Mathematical Programming (1975), 8, 232-248.
16. R. Niedermeier and P. Rossmanith, "Upper Bounds for Vertex Cover Further Improved," In Proc. of 16th STACS (1999). LNCS 1563, 561-570.
17. R. Niedermeier, P. Rossmanith, "A general method to speed up fixed-parameter-tractable algorithms," Inf. Proc. Letters (2000) 73, 125-129. (Pubitemid 30560887)
18. M. Oaksford and N. Chater, "Reasoningtheories and bounded rationality," In K.I. Manktelow & D.E. Over (Eds.) Rationality: Psychological and philosophical perspectives (1993), 31-60, Routledge.
19. J. Setubal and J. Meidanis. Introduction to Computational Molecular Biology (1997), PWS Publ. Comp.
20. H.A. Simon, "Invariants of human behavior". Ann. Rev. Psych. (1990) 41(1), 1-19.
21. U. Stege, Resolving Conflicts from Problems in Computational Biology (2000) Ph. D. thesis, No.13364, ETH Zürich.
22. U. Stege and M.R. Fellows, "An Improved Fixed-Parameter-Tractable Algorithm for Vertex Cover," (1999) Tech. Rep. 318, Dept. of Comp. Science, ETH Zürich.