Approximation Algorithms for a Network Design Problem
From MaRDI portal
Publication:5323067
DOI10.1007/978-3-642-02882-3_23zbMath1248.68552MaRDI QIDQ5323067
Binay K. Bhattacharya, Qiaosheng Shi, Yuzhuang Hu
Publication date: 23 July 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-02882-3_23
Cites Work
- Unnamed Item
- An approximation algorithm for network design problems with downwards-monotone demand functions
- A matching problem with side conditions
- A greedy heuristic for a minimum-weight forest problem
- Approximating minimum-cost graph problems with spanning tree edges
- A minimum spanning tree algorithm with inverse-Ackermann type complexity
- A primal-dual approximation algorithm for generalized Steiner network problems