Constant-Time Approximation Algorithms via Local Improvements.
Huy N. NguyenKrzysztof OnakPublished in: FOCS (2008)
Keyphrases
- approximation algorithms
- np hard
- special case
- worst case
- minimum cost
- vertex cover
- facility location problem
- network design problem
- exact algorithms
- randomized algorithms
- open shop
- primal dual
- approximation ratio
- undirected graph
- constant factor
- precedence constraints
- genetic algorithm
- set cover
- approximation guarantees
- approximation schemes
- evaluation function
- disjoint paths