Better Approximation Algorithms for Technology Diffusion.
Jochen KönemannSina Sadeghian SadeghabadLaura SanitàPublished in: ESA (2013)
Keyphrases
- approximation algorithms
- np hard
- special case
- vertex cover
- worst case
- network design problem
- facility location problem
- set cover
- open shop
- minimum cost
- approximation schemes
- approximation ratio
- undirected graph
- primal dual
- disjoint paths
- constant factor
- np hardness
- precedence constraints
- polynomial time approximation
- exact algorithms
- lower bound
- approximation guarantees
- strongly np hard
- upper bound
- combinatorial auctions
- greedy algorithm