Approximation Algorithms for Degree-Constrained Minimum-Cost Network-Design Problems.
R. RaviMadhav V. MaratheS. S. RaviDaniel J. RosenkrantzHarry B. Hunt IIIPublished in: Algorithmica (2001)
Keyphrases
- approximation algorithms
- minimum cost
- network design problem
- np hard
- network flow problem
- special case
- spanning tree
- network flow
- worst case
- exact algorithms
- undirected graph
- approximation ratio
- primal dual
- combinatorial auctions
- constant factor
- np complete
- endpoints
- search algorithm
- knapsack problem
- branch and bound algorithm
- multistage
- constraint satisfaction problems
- lower bound