Approximation Algorithms for the Vertex Bipartization Problem.
Heiko SchröderA. E. MayImrich VrtoOndrej SýkoraPublished in: SOFSEM (1997)
Keyphrases
- approximation algorithms
- undirected graph
- np hard
- special case
- minimum cost
- worst case
- vertex cover
- facility location problem
- exact algorithms
- approximation ratio
- network design problem
- open shop
- set cover
- constant factor
- disjoint paths
- minimum weight
- constant factor approximation
- randomized algorithms
- np hardness
- primal dual
- combinatorial auctions