Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms

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 compl...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Discrete Applied Mathematics Ročník 159; číslo 17; s. 1954 - 1970
Hlavní autoři:	Bourgeois, Nicolas, Escoffier, Bruno, Paschos, Vangelis Th
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Kidlington Elsevier B.V 28.10.2011 Elsevier
Témata:	Algorithmics. Computability. Computer arithmetics Algorithms Applied sciences Approximation Approximation algorithms Approximations and expansions Combinatorial analysis Combinatorics Combinatorics. Ordered structures Complexity Computation Computer science; control theory; systems Exact sciences and technology Exponential time algorithms Mathematical analysis Mathematical models Mathematics Maximum independent set Minimum vertex cover Sciences and techniques of general use Theoretical computing Maximum independent set Minimum vertex cover Approximation algorithms Exponential time algorithms Polynomial Vertex Computer theory Polynomial approximation Approximation algorithm Optimization Polynomial time Computation time NP hard problem Independent set Combinatorics Time complexity
ISSN:	0166-218X, 1872-6771
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!