Additive guarantees for degree bounded directed network design

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2008, Pages 769-778

  Bansal, Nikhil ^a   Khandekar, Rohit ^a   Nagarajan, Viswanath ^b  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Algorithms

Indexed keywords

ADDITIVES; ALGORITHMS; APPROXIMATION ALGORITHMS; COMPUTATION THEORY; DIRECTED GRAPHS; ECONOMIC AND SOCIAL EFFECTS; ITERATIVE METHODS; POLYNOMIAL APPROXIMATION;

BICRITERIA APPROXIMATION; COUNTING TECHNIQUES; DEGREE-BOUNDED MINIMUM SPANNING TREES; EDGE-WEIGHTED GRAPH; MINIMUM COST SPANNING TREE; NONNEGATIVE INTEGERS; POLYNOMIAL TIME APPROXIMATION ALGORITHMS; SUPERMODULAR FUNCTIONS;

TREES (MATHEMATICS);

EID: 51849151043     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1374376.1374486     Document Type: Conference Paper

References (19)

1. Jørgen Bang-Jensen, Stéphan Thomassé, and Anders Yeo. Small degree out-branchings. Journal of Graph Theory, 42(4), 2003.
2. Vittorio Bilò, Vineet Goyal, R. Ravi, and Mohit Singh. On the crossing spanning tree problem. In APPROX-RANDOM, 2004.
3. K. Chaudhuri, S. Rao, S. Riesenfeld, and K. Talwar. Push relabel and an improved approximation algorithm for the bounded degree MST problem. In ICALP, 2006.
4. J. Edmonds. Matroid Intersection in Discrete Optimization I. Annals of Discrete Mathematics, 4:39-49, 1979.
5. Andras Frank. Increasing the rooted-connectivity of a digraph byr one. Mathematical Programming (B), 84(3):565-576, 1999.
6. M. Furer and B. Raghavachari. Approximating the minimum-degree steiner tree to within one of optimal. Journal of Algorithms, 17(3):409-423, 1994.
7. Harold N. Gabow. On the L∞-Norm of Extreme Points for Crossing Supermodular Directed Network LPs. In IPCO, 2005.
8. Michel X. Goemans. Minimum bounded degree spanning trees. In FOCS, 2006.
9. Kamal Jain. A factor 2 approximation algorithm for the generalized steiner network problem. Combinatorica, pages 39-61, 2001.
10. Tamás Király, Lap Chi Lau, and Mohit Singh. Degree bounded matriods and submodular flows. In IPCO, 2008.
11. Philip N. Klein. Radha Krishnan. Balaji Raghavachari, and R. Ravi. Approximation algorithms for finding low-degree subgraphs. Networks, 44(3):203-215, 2004.
12. J. Konemann and R. Ravi. A matter of degree: Improved approximation algorithms for degree bounded minimum spanning trees. SIAM Journal on Computing, 31(3):1783-1793, 2002.
13. Lap Chi Lau, Joseph (Seffi) Naor, Mohammad R. Salavatipour. and Mohit Singh. Survivable network design with degree or order constraints (Full version). In STOC, 2007.
14. Lap Chi Lau and Mohit Singh. Additive approximation for bounded degree survivable network design. In STOC, 2008.
15. E.L. Lawler. Matroid intersection algorithms. Mathematical Programming, 9:31-56, 1975.
16. Vardges Melkonian and Eva Tardos. Approximation algorithms for a directed network design problem. In IPCO, 1999.
17. Viswanath Nagarajan, R. Ravi, and Mohit Singh. A simple proof of Jain's 2-approximation algorithm for Steiner Network. Manuscript, 2007.
18. R. Ravi, M.V. Marathe, S.S. Ravi, D.J. Rosenkrantz, and H.B. Hunt III. Many birds with one stone: Multi objective approximation algorithms. In STOC, 1993.
19. Mohit Singh and Lap Chi Lau. Approximating minimum bounded degree spanning trees to within one of optimal. In STOC, 2007.