The k-path tree matroid and its applications to survivable network design

We define the k-path tree matroid, and use it to solve network design problems in which the required connectivity is arbitrary for a given pair of nodes, and 1 for the other pairs. We solve the problems for undirected and directed graphs. We then use these exact algorithms to give improved approximation algorithms for problems in which the weights satisfy the triangle inequality and the connectivity requirement is either 2 among at most five nodes and 1 for the other nodes, or it is 3 among a set of three nodes and 1 for all other nodes.

[1]  Eugene Lawler,et al.  Combinatorial optimization , 1976 .

[2]  Jon Feldman,et al.  The Directed Steiner Network Problem is Tractable for a Constant Number of Terminals , 2006, SIAM J. Comput..

[3]  Éva Tardos,et al.  Algorithms for a network design problem with crossing supermodular demands , 2004, Networks.

[4]  Shu-Cherng Fang,et al.  The Point-to-point Connection Problem - Analysis and Algorithms , 1997, Discret. Appl. Math..

[5]  Torbjörn Larsson,et al.  A note on relatives to the Held and Karp 1-tree problem , 2006, Oper. Res. Lett..

[6]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[7]  Shu-Cherng Fang,et al.  On the Point-to-Point Connection Problem , 1995, Inf. Process. Lett..

[8]  Alexander Schrijver,et al.  Combinatorial optimization. Polyhedra and efficiency. , 2003 .

[9]  Thomas L. Magnanti,et al.  Designing Hierarchical Survivable Networks , 1998, Oper. Res..

[10]  Chung-Lun Li,et al.  The point-to-point delivery and connection problems: complexity and algorithms , 1992, Discret. Appl. Math..

[11]  John E. Hopcroft,et al.  The Directed Subgraph Homeomorphism Problem , 1978, Theor. Comput. Sci..

[12]  P. Macdonald.  Combinatorial Programming: Methods and Applications , 1976 .

[13]  O. Ore.  Theory of Graphs , 1962 .

[14]  K. Steiglitz,et al.  The Design of Minimum-Cost Survivable Networks , 1969 .

[15]  Greg N. Frederickson,et al.  Algorithms and Data Structures for an Expanded Family of Matroid Intersection Problems , 1989, SIAM J. Comput..

[16]  Ali Ridha Mahjoub,et al.  Design of Survivable Networks: A survey , 2005, Networks.

[17]  M. Stoer.  Design of Survivable Networks , 1993 .

[18]  Richard M. Karp,et al.  The Traveling-Salesman Problem and Minimum Spanning Trees , 1970, Oper. Res..

[19]  F. Glover,et al.  Finding Minimum Spanning Trees with a Fixed Number of Links at a Node , 1975 .

[20]  Fred W. Glover,et al.  A matroid algorithm and its application to the efficient solution of two optimization problems on graphs , 1988, Math. Program..

[21]  Kamal Jain,et al.  A Factor 2 Approximation Algorithm for the Generalized Steiner Network Problem , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[22]  Panos M. Pardalos,et al.  Design of survivable networks , 2006 .

[23]  Thomas L. Magnanti,et al.  Connectivity-splitting models for survivable network design , 2004, Networks.

[24]  Prakash Mirchandani,et al.  Opera Tions Research Center Working Paper Intuitive Solution-double Techniques for Worst-case Analysis of Some Survivable Network Design Problems. Intuitive Solution-doubling Techniques for Worst-case Analysis of Some Survivable Network Design Problems , 2022 .