Approximation Algorithms for Feasible Cut and Multicut Problems.
Bo YuJoseph CheriyanPublished in: ESA (1995)
Keyphrases
- approximation algorithms
- vertex cover
- np hard
- np hardness
- exact algorithms
- worst case
- randomized algorithms
- minimum cost
- approximation schemes
- approximation ratio
- integrality gap
- disjoint paths
- open shop
- facility location problem
- greedy heuristic
- practical problems
- benchmark problems
- traveling salesman problem
- optimization problems