Approximation Algorithms for the Graph Orientation Minimizing the Maximum Weighted Outdegree.
Yuichi AsahiroJesper JanssonEiji MiyanoHirotaka OnoKouhei ZenmyoPublished in: AAIM (2007)
Keyphrases
- approximation algorithms
- undirected graph
- np hard
- weighted graph
- constant factor
- disjoint paths
- special case
- worst case
- vertex cover
- facility location problem
- minimum cost
- approximation ratio
- network design problem
- set cover
- approximation schemes
- edge weights
- randomized algorithms
- planar graphs
- spanning tree
- open shop
- directed acyclic graph
- computational complexity
- lower bound
- weighted sum
- graph model
- directed graph
- random walk
- np hardness
- primal dual
- combinatorial auctions
- graph structure
- connected components
- minimum weight
- graph matching
- error bounds
- constant factor approximation