Parameterized Approximation Schemes using Graph Widths
Data Structures and Algorithms
2014-02-18 v2 Computational Complexity
Abstract
Combining the techniques of approximation algorithms and parameterized complexity has long been considered a promising research area, but relatively few results are currently known. In this paper we study the parameterized approximability of a number of problems which are known to be hard to solve exactly when parameterized by treewidth or clique-width. Our main contribution is to present a natural randomized rounding technique that extends well-known ideas and can be used for both of these widths. Applying this very generic technique we obtain approximation schemes for a number of problems, evading both polynomial-time inapproximability and parameterized intractability bounds.
Cite
@article{arxiv.1311.2466,
title = {Parameterized Approximation Schemes using Graph Widths},
author = {Michael Lampis},
journal= {arXiv preprint arXiv:1311.2466},
year = {2014}
}