[HTML][HTML] Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms
N Bourgeois, B Escoffier, VT Paschos - Discrete Applied Mathematics, 2011 - Elsevier
N Bourgeois, B Escoffier, VT Paschos
Discrete Applied Mathematics, 2011•ElsevierUsing ideas and results from polynomial time approximation and exact computation 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 two paradigmatic problems, max
independent set and min vertex cover.
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 two paradigmatic problems, max
independent set and min vertex cover.
Using ideas and results from polynomial time approximation and exact computation 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 two paradigmatic problems, max independent set and min vertex cover.
Elsevier
以上显示的是最相近的搜索结果。 查看全部搜索结果