Prize-Collecting Survivable Network Design in Node-Weighted Graphs-Reference-Cited by-同舟云学术

Prize-Collecting Survivable Network Design in Node-Weighted Graphs

Published:2012 Issue: Volume: Page:98-109
ISSN:0302-9743
Container-title:Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
language:
Short-container-title:

Author:

Chekuri Chandra,Ene Alina,Vakilian Ali

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-32512-0_9.pdf

Reference21 articles.

1. Aggarwal, C.C., Orlin, J.B.: On multiroute maximum flows in networks. Networks 39(1), 43–52 (2002)

2. Bienstock, D., Goemans, M.X., Simchi-Levi, D., Williamson, D.: A note on the prize collecting traveling salesman problem. Mathematical Programming 59(1), 413–420 (1993)

3. Carr, R.D., Fleischer, L.K., Leung, V.J., Phillips, C.A.: Strengthening integrality gaps for capacitated network design and covering problems. In: Proc. of ACM-SIAM SODA, pp. 106–115 (2000)

4. Lecture Notes in Computer Science;D. Chakrabarty,2011

5. Lecture Notes in Computer Science;C. Chekuri,2012

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

1. On Rooted k-Connectivity Problems in Quasi-Bipartite Digraphs;Operations Research Forum;2024-01-17

2. Node-weighted Network Design in Planar and Minor-closed Families of Graphs;ACM Transactions on Algorithms;2021-06

3. On Rooted k-Connectivity Problems in Quasi-bipartite Digraphs;Computer Science – Theory and Applications;2021

4. Approximating Node-Weighted k-MST on Planar Graphs;Theory of Computing Systems;2020-02-03

5. Approximation algorithm for the partial set multi-cover problem;Journal of Global Optimization;2019-07-03