Degree bounded matroids and submodular flows

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

Volumn 5035 LNCS, Issue , 2008, Pages 259-272

  Király, Tamás ^a   Lau, Lap Chi ^b   Singh, Mohit ^c  

^a MTA ELTE Egervary Research Group   (Hungary)

^b CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

^c CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ADDITIONAL CONSTRAINT; APPLIED (CO); BOUNDED DEGREES; COMBINATORIAL OPTIMIZATION PROBLEMS (COPS); COVER PROBLEMS; DEGREE CONSTRAINTS; FEASIBILITY PROBLEMS; GRAPH ORIENTATION; HEIDELBERG (CO); HYPER GRAPH; HYPEREDGE; IF THERE ARE; INTERNATIONAL CONFERENCES; LOWER AND UPPER BOUNDS; LOWER BOUNDS; MATROID; MAXIMUM (WEIGHTED) DEGREE; MINIMUM COSTS; NP COMPLETE; NP-HARD; OPTIMAL SOLUTIONS; SPANNING TREE PROBLEMS; SPANNING TREES; SPRINGER (CO); SUBMODULAR FLOWS; UPPER BOUNDS;

AEROSPACE APPLICATIONS; ALGORITHMS; APPROXIMATION ALGORITHMS; COMBINATORIAL MATHEMATICS; COMBINATORIAL OPTIMIZATION; DYNAMIC PROGRAMMING; EVOLUTIONARY ALGORITHMS; GRAPH THEORY; LINEAR PROGRAMMING; MATHEMATICAL PROGRAMMING; MATRIX ALGEBRA; MICROFLUIDICS; NONLINEAR PROGRAMMING; NUCLEAR PROPULSION; OPTIMIZATION; SET THEORY; TREES (MATHEMATICS);

INTEGER PROGRAMMING;

EID: 45749090575     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-68891-4_18     Document Type: Conference Paper

References (12)

1. Bansal, N., Khandekar, R., Nagarajan, V.: Additive Guarantees for Degree Bounded Directed Network Design, IBM Research Report RC24347 (September 2007)
2. Bilo, V., Goyal, V., Ravi, R., Singh, M.: On the Crossing Spanning Tree Problem. In: Jansen, K., Khanna, S., Rolim, J.D.P., Ron, D. (eds.) RANDOM 2004 and APPROX 2004. LNCS, vol. 3122, pp. 51-60. Springer, Heidelberg (2004)
3. Chaudhuri, K., Rao, S., Riesenfeld, S., Talwar, K.: A Push-Relabel Algorithm for Approximating the Minimum-Degree MST Problem and its Generalization to Matroids, Invited submission to Theoretical Computer Science (Special Issue for ICALP 2006) (2006)
4. Cunningham, W.H.: Testing membership in matroid polyhedra. Journal of Combinatorial Theory, Series B 36(2), 161-188 (1984)
5. Edmonds, J., Giles, R.: A min-max relation for submodular functions on graphs. Ann. Discrete Math. 1, 185-204 (1977)
6. Frank, A.: An algorithm for submodular functions on graphs. Ann. Discrete Math. 16, 97-120 (1982)
7. Frieze, A.: Personal Communication (March 2007)
8. Goemans, M.X.: Minimum bounded-degree spanning trees. In: Proceedings of 47th IEEE FOCS, pp. 273-282 (2006)
9. Jain, K.: A factor 2 approxiamtion algorithm for the generalized Steiner network problem. Combinatorica 21, 39-60 (2001)
10. Lau, L.C., Naor, J., Salavatipour, M., Singh, M.: Survivable network design with degree or order constraints. In: Proceedings of 39th ACM STOC, pp. 651-660 (2007)
11. Schrijver, A.: Combinatorial Optimization, Polyhedra and Efficiency. Springer, Heidelberg (2003)
12. Singh, M., Lau, L.C.: Approximating minimum bounded degree spanning trees to within one of optimal. In: Proceedings of the 39th ACM STOC, pp. 661-670 (2007)