Efficient approximation by “low-complexity” exponential algorithms
Paschos, Vangelis; Escoffier, Bruno; Bourgeois, Nicolas (2008), Efficient approximation by “low-complexity” exponential algorithms. https://basepub.dauphine.fr/handle/123456789/6009
TypeDocument de travail / Working paper
Series titleCahiers du LAMSADE
MetadataShow full item record
Abstract (EN)This paper proposes a way to bring together two seemingly “foreign” domains that are the polynomial approximation and the exact computation for NP-hard problems. We show how one can match ideas from both areas in order to design approximation algorithms achieving ratios unachievable in polynomial time (unless a very unlikely complexity conjecture is confirmed) with worst-case complexity much lower (though super-polynomial) than that of an exact computation. We then apply these ideas to two famous combinatorial optimization problems, namely, the max independent set and the min vertex cover, as well as to some other problems mainly linked to max independent set by simple approximation preserving reductions.
Subjects / Keywordspolynomial approximation; NP-hard problems; min vertex cover; max independent set
Showing items related by title and author.
Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms Bourgeois, Nicolas; Escoffier, Bruno; Paschos, Vangelis (2011) Article accepté pour publication ou publié