One-Half Approximation Algorithms for the k-Partition Problem.
Thomas A. FeoOlivier GoldschmidtMallek KhellafPublished in: Oper. Res. (1992)
Keyphrases
- approximation algorithms
- np hard
- special case
- vertex cover
- network design problem
- worst case
- minimum cost
- exact algorithms
- approximation ratio
- open shop
- polynomial time approximation
- constant factor
- facility location problem
- np hardness
- set cover
- disjoint paths
- primal dual
- precedence constraints
- randomized algorithms
- approximation schemes
- undirected graph
- constant factor approximation
- theoretical analysis
- computational complexity
- linear programming