On subexponential and FPT-time inapproximability

DOI10.1007/978-3-319-03898-8_6MaRDI QIDQ6828338zbMATH OpenFDO

Authors Édouard Bonnet, Bruno Escoffier, Eun Jung Kim, Vangelis Th. Paschos

Publication date 10 December 2013

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-03898-8_6

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25)

This page was built for publication: On subexponential and FPT-time inapproximability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6828338)