Primal-dual-based algorithms for a directed network design problem

INFORMS Journal on Computing

Volumn 17, Issue 2, 2005, Pages 159-174

  Melkonian, Vardges ^a   Tardos, Éva ^b  

^a OHIO UNIVERSITY   (United States)

^b Cornell University ^*  (United States)

Author keywords

Analysis of algorithms; Integer programming, heuristics; Networks graphs

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL METHODS; DESIGN; GRAPH THEORY; HEURISTIC METHODS; INTEGER PROGRAMMING; PROBLEM SOLVING; SET THEORY;

ANALYSIS OF ALGORITHMS; BRANCHING; CONNECTIVITY; NETWORK-GRAPHS;

ALGORITHMS;

EID: 21244445801     PISSN: 10919856     EISSN: 15265528     Source Type: Journal    
DOI: 10.1287/ijoc.1040.0066     Document Type: Article

References (14)

1. Agrawal, A., P. Klein, R. Ravi. 1995. When trees collide: An approximation algorithm for the generalized Steiner problem on networks. SIAM J. Comput. 24 445-456.
2. Edmonds, J. 1967. Optimum branchings. J. Res. National Bureau Standards B 71 233-240.
3. Frederickson, G. N., J. Jaja. 1981. Approximation algorithms for several graph augmentation problems. SIAM J. Comput. 10 270-283.
4. Goemans, M. X., D. P. Williamson. 1995. A general approximation technique for constrained forest problem. SIAM J. Comput. 24 296-317.
5. Goemans, M. X., A. Goldberg, S. Plotkin, D. Shmoys, E. Tardos, D. P. Williamson. 1994. Approximations algorithms for network design problems. Proc. 5th Annual Sympos. Discrete Algorithms, Association for Computing Machinery, New York, 223-232.
6. Held, M., R. Karp. 1970. The traveling-salesman problem and minimum spanning trees. Oper. Res. 18 1138-1162.
7. Jain, K. 1998. A factor 2 approximation algorithm for the generalized Steiner network problem. Proc. 39th Annual Sympos. Foundations Comput. Sci., Palo Alto, CA, 448-457.
8. Jain, K., V. Vazirani. 1999. Approximation algorithms for metric facility location and k-median problems using the primal-dual schema and Lagrangian relaxation. Proc. 40th Annual Sympos. Foundations Comput. Sci., New York, 2-13.
9. Melkonian, V., É. Tardos. 1999. Approximation algorithms for a directed network design problem. Proc. 7th Internat. Integer Programming Combin. Optim. Conf. (IPCO'99), Graz, Austria, 345-360.
10. Rajagopalan, S., V. Vazirani. 1999. On the bidirected cut relaxation for the metric Steiner tree problem. Proc. 10th Annual ACM-SIAM Sympos. Discrete Algorithms, Association for Computing Machinery, New York, 742-751.
11. Raz, R., S. Safra. 1997. A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP. Proc. 29th Annual ACM Sympos. Theory Comput., El Paso, Texas, 475-484.
12. TSPLIB library. 2003. Traveling salesman problem instances. ftp://ftp.zib.de/pub/Packages/mp-testdata/tsp/index.html.
13. Williamson, D. P., M. X. Goemans, M. Mihail, V. Vazirani. 1995. A primal-dual approximation algorithm for generalized Steiner network problems. Combinatorica 15 435-454.
14. Zhu, A., S. Khuller, B. Raghavachari. 1999. A uniform framework for approximating weighted connectivity problems. Proc. 10th Annual Sympos. Discrete Algorithms, Association for Computing Machinery, New York, 937-938.