Approximation Algorithms for Submodular Multiway Partition
Chandra ChekuriAlina EnePublished in: CoRR (2011)
Keyphrases
- approximation algorithms
- np hard
- special case
- worst case
- vertex cover
- set cover
- minimum cost
- facility location problem
- constant factor
- greedy algorithm
- randomized algorithms
- network design problem
- energy minimization
- approximation ratio
- np hardness
- exact algorithms
- open shop
- precedence constraints
- approximation schemes
- constant factor approximation
- primal dual
- traveling salesman problem
- learning problems
- polynomial time approximation
- graph cuts
- computational complexity
- optimal solution
- disjoint paths
- objective function