Greedy approximation algorithms for directed multicuts.
Yana KortsartsGuy KortsarzZeev NutovPublished in: Networks (2005)
Keyphrases
- approximation algorithms
- greedy algorithm
- np hard
- worst case
- special case
- vertex cover
- minimum cost
- search algorithm
- greedy heuristic
- network design problem
- approximation schemes
- np hardness
- set cover
- dynamic programming
- approximation ratio
- open shop
- primal dual
- exact algorithms
- precedence constraints
- facility location problem
- disjoint paths
- randomized algorithms
- constant factor approximation
- greedy algorithms
- undirected graph
- combinatorial auctions
- search space
- approximation guarantees
- branch and bound algorithm
- traveling salesman problem
- closest string
- multistage