Parameterized Complexity of Generalized Vertex Cover Problems
- 1 January 2005
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
Abstract
No abstract availableThis publication has 27 references indexed in Scilit:
- Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphsDiscrete Applied Mathematics, 2005
- Parameterized complexity: exponential speed-up for planar graph problemsJournal of Algorithms, 2004
- On the existence of subexponential parameterized algorithmsJournal of Computer and System Sciences, 2003
- Computing small partial coveringsInformation Processing Letters, 2003
- Approximation Algorithms for Some Parameterized Counting ProblemsLecture Notes in Computer Science, 2002
- Fixed Parameter Algorithms for DOMINATING SET and Related Problems on Planar GraphsAlgorithmica, 2002
- Faster exact algorithms for hard problems: A parameterized point of viewDiscrete Mathematics, 2001
- An improved fixed-parameter algorithm for vertex coverInformation Processing Letters, 1998
- Massaging a linear programming solution to give a 2-approximation for a generalization of the vertex cover problemLecture Notes in Computer Science, 1998
- Approximating the tree and tour covers of a graphInformation Processing Letters, 1993