On subexponential and FPT-time inapproximability
Fixed-parameter algorithms, approximation algorithms and moderately exponential
algorithms are three major approaches to algorithm design. While each of them being very …
algorithms are three major approaches to algorithm design. While each of them being very …
[HTML][HTML] Fast algorithms for min independent dominating set
N Bourgeois, F Della Croce, B Escoffier… - Discrete Applied …, 2013 - Elsevier
We first devise a branching algorithm that computes a minimum independent dominating set
with running time O∗(1.3351 n)= O∗(20.417 n) and polynomial space. This improves upon …
with running time O∗(1.3351 n)= O∗(20.417 n) and polynomial space. This improves upon …
[HTML][HTML] Time-approximation trade-offs for inapproximable problems
In this paper we focus on problems inapproximable in polynomial time and explore how
quickly their approximability improves as the allowed running time is gradually increased …
quickly their approximability improves as the allowed running time is gradually increased …
(In) approximability of maximum minimal FVS
We study the approximability of the NP-complete Maximum Minimal Feedback Vertex Set
problem. Informally, this natural problem seems to lie in an intermediate space between two …
problem. Informally, this natural problem seems to lie in an intermediate space between two …
An exponential time 2-approximation algorithm for bandwidth
The bandwidth of a graph G on n vertices is the minimum b such that the vertices of G can be
labeled from 1 to n such that the labels of every pair of adjacent vertices differ by at most b …
labeled from 1 to n such that the labels of every pair of adjacent vertices differ by at most b …
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) …
[HTML][HTML] Approximating MAX SAT by moderately exponential and parameterized algorithms
B Escoffier, VT Paschos, E Tourniaire - Theoretical Computer Science, 2014 - Elsevier
We study approximation of the max sat problem by moderately exponential algorithms. The
general goal of the issue of moderately exponential approximation is to catch-up on …
general goal of the issue of moderately exponential approximation is to catch-up on …
Time-approximation trade-offs for inapproximable problems
In this paper we focus on problems which do not admit a constant-factor approximation in
polynomial time and explore how quickly their approximability improves as the allowed …
polynomial time and explore how quickly their approximability improves as the allowed …
Subexponential and FPT-time inapproximability of independent set and related problems
B Escoffier, EJ Kim, VT Paschos - arXiv preprint arXiv:1211.6656, 2012 - arxiv.org
Fixed-parameter algorithms, approximation algorithms and moderately exponential
algorithms are three major approaches to algorithms design. While each of them being very …
algorithms are three major approaches to algorithms design. While each of them being very …
[图书][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 …