Approximation algorithms for maximum cut with limited unbalance.
Giulia GalbiatiFrancesco MaffioliPublished in: Theor. Comput. Sci. (2007)
Keyphrases
- approximation algorithms
- integrality gap
- np hard
- special case
- worst case
- vertex cover
- facility location problem
- minimum cost
- network design problem
- primal dual
- combinatorial auctions
- approximation ratio
- open shop
- precedence constraints
- randomized algorithms
- set cover
- disjoint paths
- approximation schemes
- np hardness
- exact algorithms
- approximation guarantees
- dynamic programming
- undirected graph
- upper bound