Improved approximations for buy-at-bulk and shallow-light $$k$$ k -Steiner trees and $$(k,2)$$ ( k , 2 ) -subgraph-Reference-Cited by-同舟云学术

Improved approximations for buy-at-bulk and shallow-light $$k$$ k -Steiner trees and $$(k,2)$$ ( k , 2 ) -subgraph

Published:2014-08-13 Issue:2 Volume:31 Page:669-685
ISSN:1382-6905
Container-title:Journal of Combinatorial Optimization
language:en
Short-container-title:J Comb Optim

Author:

Khani M. Reza,Salavatipour Mohammad R.

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications

Link

http://link.springer.com/content/pdf/10.1007/s10878-014-9774-5.pdf

Reference37 articles.

1. Andrews M (2004) Hardness of buy-at-bulk network design. Proceedings of IEEE FOCS, pp 115–124.

2. Andrews M, Zhang L (2002) Approximation algorithms for access network design. Algorithmica 32(2):197–215

3. Antonakopoulos S, Chekuri C, Shepherd B, Zhang L (2011) Buy-at-bulk network design with protection. Mathe Oper Res 36(1):71–87

4. Awerbuch B, Azar Y. (1997) Buy-at-bulk network design, In Proceedings of the 38th Annual Symposium on Foundations of Computer Science (FOCS ’97), pp 542–547.

5. Awerbuch B, Azar Y, Blum A, Vempala S (1999) New approximation guarantees for minimum-weight $$k$$ k -trees and prize-collecting salesmen. SIAM J Comput 28(1):254–262

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. To Store or Not to Store: a graph theoretical approach for Dataset Versioning;2024 IEEE International Parallel and Distributed Processing Symposium (IPDPS);2024-05-27

2. 2-node-connectivity network design;Theoretical Computer Science;2024-03

3. 2-Node-Connectivity Network Design;2023

4. Hop-Constrained Metric Embeddings and their Applications;2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS);2022-02

5. 2-Node-Connectivity Network Design;Approximation and Online Algorithms;2021