Constant-Time Approximation Algorithms for the Optimum Branching Problem on Sparse Graphs.
Mitsuru KusumotoYuichi YoshidaHiro ItoPublished in: Int. J. Netw. Comput. (2013)
Keyphrases
- approximation algorithms
- undirected graph
- constant factor approximation
- np hard
- vertex cover
- special case
- minimum cost
- worst case
- constant factor
- network design problem
- approximation guarantees
- randomized algorithms
- facility location problem
- directed graph
- branch and bound
- set cover
- primal dual
- graph matching
- open shop
- scheduling problem
- np hardness
- search tree
- disjoint paths
- bipartite graph
- error bounds
- approximation schemes
- approximation ratio
- spanning tree
- weighted graph