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žené v:
Podrobná bibliografia
Vydané v:Discrete Applied Mathematics Ročník 159; číslo 17; s. 1954 - 1970
Hlavní autori: Bourgeois, Nicolas, Escoffier, Bruno, Paschos, Vangelis Th
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Kidlington Elsevier B.V 28.10.2011
Elsevier
Predmet:
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 prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí: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. ► We propose exponential time approximation algorithms for solving NP-hard problems. ► This approach is considered for Max Independent Set and Min Vertex Cover. ► We achieve interesting tradeoffs between running times and approximation ratios. ► Used techniques are splitting of the instance, parameterized algorithms, randomization.
Bibliografia:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0166-218X
1872-6771
DOI:10.1016/j.dam.2011.07.009