Approximation Algorithms for Orienting Mixed Graphs.
Michael ElberfeldDanny SegevColin R. DavidsonDana SilverbushRoded SharanPublished in: CPM (2011)
Keyphrases
- approximation algorithms
- undirected graph
- np hard
- special case
- worst case
- vertex cover
- minimum cost
- primal dual
- facility location problem
- randomized algorithms
- approximation guarantees
- set cover
- spanning tree
- graph matching
- open shop
- np hardness
- approximation schemes
- polynomial time approximation
- approximation ratio
- constant factor approximation
- network design problem
- combinatorial auctions
- bipartite graph
- integer programming
- branch and bound algorithm
- directed graph
- computational complexity
- search algorithm
- disjoint paths
- optimal solution