Approximation Algorithms for Submodular Multiway Partition.
Chandra ChekuriAlina EnePublished in: FOCS (2011)
Keyphrases
- approximation algorithms
- np hard
- special case
- worst case
- vertex cover
- greedy algorithm
- network design problem
- minimum cost
- approximation ratio
- set cover
- exact algorithms
- primal dual
- constant factor
- open shop
- undirected graph
- precedence constraints
- np hardness
- facility location problem
- randomized algorithms
- approximation schemes
- disjoint paths
- energy minimization
- polynomial time approximation
- linear programming
- upper bound
- lower bound
- computational complexity