Constant-Time Approximation Algorithms for the Optimum Branching Problem on Sparse Graphs.
Mitsuru KusumotoYuichi YoshidaHiro ItoPublished in: ICNC (2012)
Keyphrases
- approximation algorithms
- constant factor approximation
- undirected graph
- np hard
- special case
- worst case
- vertex cover
- minimum cost
- facility location problem
- network design problem
- primal dual
- branch and bound
- approximation guarantees
- set cover
- approximation schemes
- approximation ratio
- lower bound
- graph structure
- disjoint paths
- polynomial time approximation
- directed graph
- precedence constraints
- constant factor
- branch and bound algorithm
- randomized algorithms
- search algorithm
- spanning tree
- np complete
- search tree
- weighted graph