Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree.
Yuichi AsahiroJesper JanssonEiji MiyanoHirotaka OnoKouhei ZenmyoPublished in: J. Comb. Optim. (2011)
Keyphrases
- approximation algorithms
- undirected graph
- np hard
- weighted graph
- constant factor
- disjoint paths
- special case
- vertex cover
- minimum cost
- worst case
- graph model
- edge weights
- spanning tree
- facility location problem
- primal dual
- network design problem
- np hardness
- random walk
- approximation ratio
- randomized algorithms
- directed graph
- set cover
- approximation schemes
- integrality gap
- open shop
- combinatorial auctions
- precedence constraints
- planar graphs
- approximation guarantees
- connected components
- learning algorithm
- directed acyclic graph