Subexponential Parameterized Algorithms Collapse the W-Hierarchy
- 4 July 2001
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 273-284
- https://doi.org/10.1007/3-540-48224-5_23
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Faster exact algorithms for hard problems: A parameterized point of viewDiscrete Mathematics, 2001
- Fixed Parameter Algorithms for Planar Dominating Set and Related ProblemsLecture Notes in Computer Science, 2000
- Parameterized ComplexityPublished by Springer Nature ,1999
- Vertex Cover: Further Observations and Further ImprovementsLecture Notes in Computer Science, 1999
- An improved fixed-parameter algorithm for vertex coverInformation Processing Letters, 1998
- On Fixed-Parameter Tractability and Approximability of NP Optimization ProblemsJournal of Computer and System Sciences, 1997
- Fixed-parameter tractability and completeness II: On completeness for W[1]Theoretical Computer Science, 1995
- Parameterized Computational FeasibilityPublished by Springer Nature ,1995
- The Complexity of Decision Versus SearchSIAM Journal on Computing, 1994
- Approximation algorithms for NP-complete problems on planar graphsJournal of the ACM, 1994