Fixed-Parameter and Approximation Algorithms: A New Look
Authors:
- 1 January 2013
- book chapter
- Published by Springer Nature
- p. 110-122
Abstract
No abstract availableKeywords
All Related Versions
This publication has 17 references indexed in Scilit:
- Completely inapproximable monotone and antimonotone parameterized problemsJournal of Computer and System Sciences, 2013
- Parameterized Complexity of Arc-Weighted Directed Steiner ProblemsSIAM Journal on Discrete Mathematics, 2011
- Parameterized Complexity and Approximation AlgorithmsThe Computer Journal, 2007
- Parameterized Complexity of Cardinality Constrained Optimization ProblemsThe Computer Journal, 2007
- Polylogarithmic inapproximability2003
- On the Complexity of k-SATJournal of Computer and System Sciences, 2001
- Parameterized Complexity1999
- On the hardness of approximating minimization problemsJournal of the ACM, 1994
- Efficient probabilistically checkable proofs and applications to approximations1993
- The steiner problem in graphsNetworks, 1971