Abstract
We design approximation algorithms for several NP-hard combinatorial problems achieving ratios that cannot be achieved 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 study in particular max independent set, min vertex cover and min set cover and then extend our results to max clique, max bipartite subgraph and max set packing. © 2009 Springer Berlin Heidelberg.
Cite
CITATION STYLE
Bourgeois, N., Escoffier, B., & Paschos, V. T. (2009). Efficient approximation of combinatorial problems by moderately exponential algorithms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5664 LNCS, pp. 507–518). Springer Verlag. https://doi.org/10.1007/978-3-642-03367-4_44
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
