Combinatorial approximation algorithms for the maximum directed cut problem.
Eran HalperinUri ZwickPublished in: SODA (2001)
Keyphrases
- approximation algorithms
- integrality gap
- np hard
- special case
- vertex cover
- worst case
- minimum cost
- facility location problem
- approximation ratio
- randomized algorithms
- exact algorithms
- approximation schemes
- primal dual
- np hardness
- set cover
- open shop
- network design problem
- linear programming relaxation
- combinatorial auctions
- undirected graph
- constant factor approximation
- disjoint paths
- simulated annealing