Additive guarantees for degree-bounded directed network design

SIAM Journal on Computing

Volumn 39, Issue 4, 2009, Pages 1413-1431

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

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

Author keywords

Approximation algorithms; Directed graphs; Network design

Indexed keywords

BICRITERIA APPROXIMATION; CONNECTIVITY PROBLEMS; COST SPANNING; DEGREE BOUNDS; DIRECTED GRAPHS; DIRECTED NETWORK; EDGE-WEIGHTED GRAPH; LP RELAXATION; MINIMUM SPANNING TREES; NETWORK DESIGN; NONNEGATIVE INTEGERS; POLYNOMIAL-TIME APPROXIMATION ALGORITHMS; SPANNING TREE PROBLEMS; SUBGRAPHS; SUPERMODULAR; SUPERMODULAR FUNCTIONS; UPPER BOUND;

APPROXIMATION ALGORITHMS; COMPUTATION THEORY; COSTS; DESIGN; POLYNOMIAL APPROXIMATION; SET THEORY;

GRAPH THEORY;

EID: 70350176693     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/080734340     Document Type: Article

References (18)

1. J. Bang-Jensen, S. Thomass, and A. Yeo, Small degree out-branchings, J. Graph Theory, 42 (2003), pp. 297-307.
2. V. Bilò, V. Goyal, R. Ravi, and M. Singh, On the crossing spanning tree problem, in Proceedings of the 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2004, pp. 51-60.
3. K. Chaudhuri, S. Rao, S. Riesenfeld, and K. Talwar, Push relabel and an improved approximation algorithm for the bounded degree MST problem, in Proceedings of 33rd International Colloquium on Automata, Languages and Programming (ICALP), 2006, pp. 191-201.
4. J. Edmonds, Matroid intersection in discrete optimization I, Ann. Discrete Math., 4 (1979), pp. 39-49.
5. A. Frank, Increasing the rooted-connectivity of a digraph by one, Math. Programming (B), 84 (1999), pp. 565-576.
6. M. Fürer and B. Raghavachari, Approximating the minimum-degree Steiner tree to within one of optimal, J. Algorithms, 17 (1994), pp. 409-423.
7. H. N. Gabow, On the L-norm of extreme points for crossing supermodular directed network LPs, Math. Programming (B), 110 (2007), pp. 111-144.
8. M. X. Goemans, Minimum bounded degree spanning trees, in Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 2006, pp. 273-282.
9. K. Jain, A factor 2 approximation algorithm for the generalized Steiner network problem, Combinatorica, 21 (2001), pp. 39-61.
10. T. Király, L. C. Lau, and M. Singh, Degree bounded matroids and submodular flows, in Proceedings of the 13th International Conference on Integer Programming and Combinatorial Optimization (IPCO), 2008, pp. 259-272.
11. P. N. Klein, R. Krishnan, B. Raghavachari, and R. Ravi, Approximation algorithms for finding low-degree subgraphs, Networks, 44 (2004), pp. 203-215.
12. J. Könemann and R. Ravi, A matter of degree: Improved approximation algorithms for degreebounded minimum spanning trees, SIAM J. Comput., 31 (2002), pp. 1783-1793.
13. L. C. Lau, J. (S.) Naor, M. R. Salavatipour, and M. Singh, Survivable network design with degree or order constraints (full version), in Proceedings of the 40th Annual ACM Symposium on Theory of Computing (STOC), 2007, pp. 651-660.
14. E. L. Lawler, Matroid intersection algorithms, Math. Program., 9 (1975), pp. 31-56.
15. V. Melkonian and é. Tardos, Algorithms for a network design problem with crossing supermodular demands, Networks, 43 (2004), pp. 256-265.
16. V. Nagarajan, R. Ravi, and M. Singh, Unified Analysis of LP Extreme Points for Steiner Networks and Traveling Salesman, manuscript, 2008.
17. R. Ravi, M. V. Marathe, S. S. Ravi, D. J. Rosenkrantz, and H. B. Hunt III, Approximation algorithms for degree-constrained minimum-cost network-design problems, Algorithmica, 31 (2001), pp. 58-78.
18. M. Singh and L. C. Lau, Approximating minimum bounded degree spanning trees to within one of optimal, in Proceedings of the 40th Annual ACM Symposium on Theory of Computing (STOC), 2007, pp. 661-670.