Approximation Algorithms for a Directed Network Design Problem-Reference-Cited by-同舟云学术

Approximation Algorithms for a Directed Network Design Problem

Published:1999 Issue: Volume: Page:345-360
ISSN:0302-9743
Container-title:Integer Programming and Combinatorial Optimization
language:
Short-container-title:

Author:

Melkonian Vardges,Tardos Éva

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-48777-8_26

Reference12 articles.

1. A. Agrawal, P. Klein, and R. Ravi. When trees collide: An approximation algorithm for generalized Steiner tree problems on networks. In Proceedings of the 23rd ACM Symposium on Theory of Computing, pages 134–144, 1991.

2. M. Charikar, C. Chekuri, T. Cheung, Z. Dai, A. Goel, S. Guha, and M. Li. Approximation algorithms for directed Steiner problems. In Proceedings of the 9th Annual Symposium of Discrete Algorithms, pages 192–200, 1998.

3. J. Edmonds. Edge-disjoint branchings. In R. Rustin, editor, Combinatorial Algorithms, pages 91–96. Academic Press, New York, 1973.

4. M. X. Goemans, A. Goldberg, S. Plotkin, D. Shmoys, E. Tardos, and D. P. Williamson. Approximations algorithms for network design problems. In Proceedings of the 5th Annual Symposium on Discrete Algorithms, pages 223–232, 1994.

5. M. X. Goemans and D. P. Williamson. A general approximation technique for constrained forest problem. SIAM Journal on Computing, 24:296–317, 1995.

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

1. On matrices with the Edmonds–Johnson property arising from bidirected graphs;Journal of Combinatorial Theory, Series B;2018-05

2. An exact algorithm for the min-cost network containment problem;Networks;2004-01-15

3. Network Design Problems;Algorithms and Combinatorics;2002

4. Edge Covers of Setpairs and the Iterative Rounding Method;Integer Programming and Combinatorial Optimization;2001

5. A 2-Approximation for Minimum Cost {0, 1, 2} Vertex Connectivity;Integer Programming and Combinatorial Optimization;2001