A survey on approximation in parameterized complexity: Hardness and algorithms
Parameterization and approximation are two popular ways of coping with NP-hard
problems. More recently, the two have also been combined to derive many interesting …
problems. More recently, the two have also been combined to derive many interesting …
Exact and approximate bandwidth
M Cygan, M Pilipczuk - Theoretical Computer Science, 2010 - Elsevier
In this paper we gather several improvements in the field of exact and approximate
exponential time algorithms for the Bandwidth problem. For graphs with treewidth t we …
exponential time algorithms for the Bandwidth problem. For graphs with treewidth t we …
The top eight misconceptions about NP-hardness
ZÁ Mann - Computer, 2017 - ieeexplore.ieee.org
The Top Eight Misconceptions about NP-Hardness Page 1 72 COMPUTER PUBLISHED BY
THE IEEE COMPUTER SOCIETY 0018-9162/17/$33.00 © 2017 IEEE PERSPECTIVES …
THE IEEE COMPUTER SOCIETY 0018-9162/17/$33.00 © 2017 IEEE PERSPECTIVES …
Parameterized approximation via fidelity preserving transformations
We motivate and describe a new parameterized approximation paradigm which studies the
interaction between performance ratio and running time for any parametrization of a given …
interaction between performance ratio and running time for any parametrization of a given …
Parameterized Approximation Algorithms for Hitting Set
L Brankovic, H Fernau - … and Online Algorithms: 9th International Workshop …, 2012 - Springer
LNCS 7164 - Parameterized Approximation Algorithms for <TEX>{\sc Hitting Set}</TEX> Page 1
Parameterized Approximation Algorithms for Hitting Set Ljiljana Brankovic1 and Henning …
Parameterized Approximation Algorithms for Hitting Set Ljiljana Brankovic1 and Henning …
Approximation of min coloring by moderately exponential algorithms
N Bourgeois, B Escoffier, VT Paschos - Information Processing Letters, 2009 - Elsevier
We study in this note approximation algorithms for the problem of coloring the vertices of a
graph with as few colors as possible, with moderately exponential running times (and using …
graph with as few colors as possible, with moderately exponential running times (and using …
Capacitated domination faster than O (2n)
M Cygan, M Pilipczuk, JO Wojtaszczyk - Information processing letters, 2011 - Elsevier
In this paper we consider the Capacitated Dominating Set problem—a generalisation of the
Dominating Set problem where each vertex v is additionally equipped with a number c (v) …
Dominating Set problem where each vertex v is additionally equipped with a number c (v) …
Combining two worlds: parameterised approximation for vertex cover
L Brankovic, H Fernau - International Symposium on Algorithms and …, 2010 - Springer
We explore opportunities for parameterising constant factor approximation algorithms for
vertex cover. We provide a simple algorithm that works on any approximation ratio of the …
vertex cover. We provide a simple algorithm that works on any approximation ratio of the …
Fast Algorithms for min independent dominating set
N Bourgeois, B Escoffier, VT Paschos - … 2010, Şirince, Turkey, June 7-11 …, 2010 - Springer
We first devise a branching algorithm that computes a minimum independent dominating set
with running time O*(2 0.424 n) and polynomial space. This improves the O*(2 0.441 n) …
with running time O*(2 0.424 n) and polynomial space. This improves the O*(2 0.441 n) …
[图书][B] Optimization Theory, Decision Making, and Operations Research Applications: Proceedings of the 1st International Symposium and 10th Balkan Conference on …
These proceedings consist of 30 selected research papers based on results presented at
the 10th Balkan Conference & 1st International Symposium on Operational Research …
the 10th Balkan Conference & 1st International Symposium on Operational Research …