Degree bounded network design with metric costs

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2008, Pages 125-134

  Chan, Yuk Hei ^a   Fung, Wai Shing ^a   Lau, Lap Chi ^a   Yung, Chun Kong ^a  

^a CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

BOUNDED DEGREES; BOUNDED NETWORKS; CONSTANT FACTORS; DEGREE BOUNDS; DEGREE CONSTRAINTS; FEASIBLE SOLUTIONS; MAXIMUM DEGREES; METRIC COSTS; MINIMUM COSTS; NETWORK DESIGN PROBLEMS; NP-HARD; OPTIMAL COSTS; POLYNOMIAL FACTORS; SPANNING TREE PROBLEMS; SPANNING TREES; STEINER NETWORKS; SUBGRAPH; SUBGRAPH PROBLEMS; TECHNICAL TOOLS; TRIANGLE INEQUALITIES; UNDIRECTED GRAPHS;

COMPUTERS; COST FUNCTIONS; COSTS; DESIGN; FIBER OPTIC CHEMICAL SENSORS; MASS TRANSPORTATION; METROPOLITAN AREA NETWORKS; POLYNOMIAL APPROXIMATION; TREES (MATHEMATICS); WIRELESS TELECOMMUNICATION SYSTEMS;

APPROXIMATION ALGORITHMS;

EID: 57949102789     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2008.28     Document Type: Conference Paper

References (36)

1. S. Arora, K.L. Chang: Approximations schemes for degree-restricted MST and red-blue separation problem. Algorithmica 40(3): 189-210,2004.
2. J. Bang-Jensen, A. Frank, B. Jackson: Preserving and increasing local edge-connectivity in mixed graph. SIAM J. Discrete Math. 8(2), 155-178, 1995.
3. J. Bang-Jensen, T. Jordán: Edge-connectivity augmentation preserving simplicity. SIAM J. Discrete Math. 11(4): 603-623, 1998.
4. J. Bang-Jensen, T. Jordán: Splitting off edges within a specified subset preserving the edge-connectivity of the graph. Journal of Algorithms 37(2), 326-343, 2000.
5. A. Bernáth, T. Király: A new approach to splitting-off. Proceedings of 13th International Conference on Integer Programming and Combinatorial Optimization, 401-415, 2008.
6. D. Bienstock, E.F. Brickell, C.L. Monma: On the structure of minimum-weight k-connected spanning networks. SIAM J. Discrete Math. 3(3) 320-329, 1990.
7. T.M. Chan: Euclidean bounded-degree spanning tree ratios.Proc. 19th Symp. Computational Geometry, 11-19, 2003.
8. J. Cheriyan, T. Jordán, Z. Nutov: On rooted node-connectivity problems. Algorithmica. 30: 353-375, 2001.
9. J. Cheriyan, A. Vetta: Approximation algorithms for network design with metric costs. SIAM J. Discrete Math. 21(3): 612-636, 2007.
10. N. Christofides: Worst-case analysis of a new heuristic for the travelling salesman problem. Report 388, Graduate School of Industrial Administration, CMU, 1976.
11. A. Czumaj, A. Lingas: Approximation schemes for minimum-cost k-connectivity problems in geometric graphs. Handbook of Approximation Algorithms and Metaheuristics, Ch. 51 (2007).
12. S.P. Fekete, S. Khuller, M. Klemmstein, B. Raghavachari, N. Young: A network-flow technique for finding low-weight bounded-degree trees. Journal of Algorithms 24(2), 310-324, 1997.
13. A. Frank: Augmenting graphs to meet edge-connectivity requirements, SIAM J. Discrete Math. 5(1): 25-53, 1992.
14. A. Frank: Edge-connection of graphs, digraphs, and hypergraphs. EGRES - Egerváry Research Group on Combinatorial Optimization, Technical Report, TR-2001-11.
15. T. Fukunaga, H. Nagamochi: Approximating a generalization of metric TSP. IEICE Trans. Inf. & Syst., VOL.E90D, 2007.
16. T. Fukunaga: Approximation algorithms to the network design problems. Doctoral Dissertation 2007.
17. T. Fukunaga, H. Nagamochi: Network design with edge connectivity and degree constraints. Approximation and Online Algorithms, Lecture Notes in Computer Science, Springer, Volume 4368, 188-201, 2007.
18. M.X. Goemans: Minimum bounded-degree spanning trees. Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science, 273-282, 2006.
19. K. Jain: A factor 2 approximation algorithm for the generalized Steiner network problem. Combinatorica 21(1), 39-60, 2001.
20. T. Jordán: Constrained edge-splitting problems. SIAM J. Discrete Math. 17(1), 88-102, 2003.
21. R. Jothi, B. Raghavachari: Degree-bounded minimum spanning trees. Proc. 16th Canadian Conf. on Computational Geometry: 192-195, 2004.
22. S. Khuller, B. Raghavachari, N. Young: Low degree spanning trees of small weight. SIAM Journal on Computing 25, 355-368, 1994.
23. S. Khuller, U. Vishkin: Biconnectivity approximations and graph carvings. Journal of the ACM 41, 214-235, 1994.
24. G. Kortsarz, Z. Nutov: Approximating node connectivity problems via set covers. Algorithmica 37(2), 75-92, 2003.
25. G. Kortsarz and Z. Nutov: Approximating min-cost connectivity problems, Survey Chapter in Approximation Algorithms and Metaheuristics, Editor T.F. Gonzalez, 2006.
26. M. Kriesell: Edge-disjoint trees containing some given vertices in a graph. J. Combin. Theory B, 88, 53-63, 2003.
27. L.C. Lau: An approximate max-Steiner-tree-packing min-Steiner-cut theorem. Combinatorica 27(1), 71-90, 2007.
28. L.C. Lau, J. Naor, M.R. Salavatipour, M. Singh: Survivable network design with degree or order constraints. Proceedings of the 39th Annual Symposium on Theory of Computing, 651-660, 2007.
29. L.C. Lau, M. Singh: Additive approximation for bounded degree survivable network design. Proceedings of the 40th Annual Symposium on Theory of Computing,759-768, 2008.
30. L. Lovász: Combinatorial problems and exercises, North-Holland, 1993.
31. W. Mader: A reduction method for edge-connectivity in graphs. Annals of Discrete Mathematics 3, 145-164, 1978.
32. W. Mader: Konstruktion aller n-fach kantenzusam-menhängenden. Digraphen, Europ. J. Combinatorics 3, 63-67, 1982.
33. C.L. Monma, B.S. Munson, W.R. Pulleyblank: Minimum-weight two-connected spanning networks. Math. Prog. 46, 153-171 (1990).
34. C.L. Monma, S. Suri: Transitions in geometric minimum spanning trees (extended abstract). Proceedings of the seventh annual symposium on Computational geometry, 1991.
35. A. Schrijver: Combinatorial optimization - polyhedra and efficiency. Springer-Verlag, Berlin, 2003.
36. M. Singh, L.C. Lau: Approximating minimum bounded degree spanning trees to within one of optimal. Proceedings of the 39th Annual Symposium on Theory of Computing, 661-670, 2007.