Approximation algorithms for a directed network design problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1610, Issue , 1999, Pages 345-360

  Melkonian, Vardges ^a   Tardos, Éva ^a  

^a Department of Molecular Biology and Genetics   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; INTEGER PROGRAMMING;

BASIC SOLUTIONS; DIRECTED NETWORK; LP RELAXATION; MINIMUM COST; NETWORK DESIGN PROBLEMS; SUPERMODULAR; UNDIRECTED NETWORK; VERTEX SET;

APPROXIMATION ALGORITHMS;

EID: 84948946277     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48777-8_26     Document Type: Conference Paper

References (12)

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.
6. M. Grötschel, L. Lovász, and A. Schrijver. Geometric algorithms and combinatorial optimization. Springer-Verlag, 1988.
7. C. A. Hurkens, L. Lovász, A. Schrijver, and E. Tardos. How to tidy up your set-system? In Proceedings of Colloquia Math.ematica Societatis Janos Bolyai. 52. Combinatorics, pages 309-314, 1987.
8. K. Jain. A factor 2 approximation algorithm for the generalized Steiner network problem. In Proceedings of the 39th, Annual Symposium, on. the Foundation of Computer Science, pages 448-457, 1998.
9. S. Khuller and U. Vishkin. Biconnectivity approximations and graph carvings. Journal of the Association of Computing Machinery, 41:214-235, 1994.
10. R. Raz and S. Safra. A sub-constant error-probability low-degree test, and a subconstant error-probability PCP characterization of NP. In Proceedings of the 29th. Annual ACM Symposium, on. the Theory of Computing, pages 475-484, 1997.
11. A. Frank. Kernel systems of directed graphs. Acta Sci. Math. (Szeged), 41:63-76, 1979.
12. D. P. Williamson, M. X. Goemans, M. Mihail, and V. V. Vazirani. A primal-dual approximation algorithm for generalized Steiner network problems. Combinatorica, 15:435-454, 1995.