Exact and approximation algorithms for computing optimal fat decompositions.
Mirela DamianPublished in: Comput. Geom. (2004)
Keyphrases
- approximation algorithms
- worst case
- minimum cost
- constant factor
- np hard
- special case
- approximation schemes
- facility location problem
- network design problem
- primal dual
- vertex cover
- np hardness
- marginal probabilities
- randomized algorithms
- set cover
- exact algorithms
- open shop
- approximation guarantees
- optimal solution
- approximation ratio
- dynamic programming
- strongly np hard
- network flow
- undirected graph
- combinatorial auctions
- upper bound
- search algorithm
- objective function
- disjoint paths