Parameterized approximation problems

Authors:
Rodney G. Downey;Michael R. Fellows;Catherine McCartin
Affiliations:
Victoria University, Wellington, New Zealand;The University of Newcastle, Calaghan, Australia;Massey University, Palmerston North, New Zealand
Venue:
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Year:
2006

Citing 4
Cited 15

On the efficiency of polynomial time approximation schemes

Information Processing Letters
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
The Parameterized Complexity of Counting Problems

SIAM Journal on Computing
Parameterized Complexity

Parameterized Complexity

Parameterizing above or below guaranteed values

Journal of Computer and System Sciences
Efficient approximation of min set cover by moderately exponential algorithms

Theoretical Computer Science
Efficient Approximation of Combinatorial Problems by Moderately Exponential Algorithms

WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Parameterized algorithms

Algorithms and theory of computation handbook
Improved approximations for hard optimization problems via problem instance classification

Rainbow of computer science
Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms

Discrete Applied Mathematics
The parameterized complexity of local consistency

CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Approximating MAX SAT by moderately exponential and parameterized algorithms

TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
Backdoors to satisfaction

The Multivariate Algorithmic Revolution and Beyond
Parameterized approximability of the disjoint cycle problem

ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Completely inapproximable monotone and antimonotone parameterized problems

Journal of Computer and System Sciences
Efficient algorithms for the max k-vertex cover problem

TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
Fast algorithms for min independent dominating set

Discrete Applied Mathematics
Exponential approximation schemata for some network design problems

Journal of Discrete Algorithms
An exponential time 2-approximation algorithm for bandwidth

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Up to now, most work in the area of parameterized complexity has focussed on exact algorithms for decision problems. The goal of this paper is to apply parameterized ideas to approximation. We begin exploration of parameterized approximation problems, where the problem in question is a parameterized decision problem, and the required approximation factor is treated as a second parameter for the problem.