Finding disjoint paths with related path costs
暂无分享,去创建一个
[1] Ravindra K. Ahuja,et al. Network Flows: Theory, Algorithms, and Applications , 1993 .
[2] Mihalis Yannakakis,et al. Primal-dual approximation algorithms for integral flow and multicut in trees , 1997, Algorithmica.
[3] John E. Hopcroft,et al. The Directed Subgraph Homeomorphism Problem , 1978, Theor. Comput. Sci..
[4] H. T. Mouftah,et al. Issues on diverse routing for WDM mesh networks with survivability , 2001, Proceedings Tenth International Conference on Computer Communications and Networks (Cat. No.01EX495).
[5] Clifford Stein,et al. Approximating Disjoint-Path Problems Using Greedy Algorithms and Packing Integer Programs ( Extended Abstract ) , 1998 .
[6] Murali S. Kodialam,et al. Dynamic routing of restorable bandwidth-guaranteed tunnels using aggregated network resource usage information , 2003, TNET.
[7] Venkatesan Guruswami,et al. Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems , 2003, J. Comput. Syst. Sci..
[8] Chung-Lun Li,et al. Finding disjoint paths with different path-costs: Complexity and algorithms , 1992, Networks.
[9] Alexander Schrijver,et al. Paths, Flows, and VLSI-Layout , 1990 .
[10] Jon M. Kleinberg,et al. Approximation algorithms for disjoint paths problems , 1996 .
[11] Alon Itai,et al. On the Complexity of Timetable and Multicommodity Flow Problems , 1976, SIAM J. Comput..
[12] Chung-Lun Li,et al. The complexity of finding two disjoint paths with min-max objective function , 1989, Discret. Appl. Math..
[13] J. W. Suurballe. Disjoint paths in a network , 1974, Networks.
[14] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[15] Chunming Qiao,et al. On finding disjoint paths in single and dual link cost networks , 2004, IEEE INFOCOM 2004.
[16] Sanjeev Khanna,et al. Edge-disjoint paths in planar graphs , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[17] Viggo Kann,et al. Polynomially Bounded Minimization Problems That Are Hard to Approximate , 1993, Nord. J. Comput..
[18] Ganesh Venkataraman,et al. Graph decomposition and a greedy algorithm for edge-disjoint paths , 2004, SODA '04.
[19] Richard M. Karp,et al. On the Computational Complexity of Combinatorial Problems , 1975, Networks.
[20] Sanjeev Khanna,et al. Edge disjoint paths revisited , 2003, SODA '03.
[21] Lisa Zhang,et al. Hardness of the undirected edge-disjoint paths problem with congestion , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).
[22] Alon Itai,et al. The complexity of finding maximum disjoint paths with length constraints , 1982, Networks.
[23] Yossi Shiloach,et al. A Polynomial Solution to the Undirected Two Paths Problem , 1980, JACM.
[24] Mihalis Yannakakis,et al. Optimization, approximation, and complexity classes , 1991, STOC '88.
[25] Yehoshua Perl,et al. Heuristics for finding a maximum number of disjoint bounded paths , 1984, Networks.
[26] Aravind Srinivasan,et al. Improved approximations for edge-disjoint paths, unsplittable flow, and related routing problems , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.
[27] Serge A. Plotkin. Competitive Routing of Virtual Circuits in ATM Networks , 1995, IEEE J. Sel. Areas Commun..
[28] Murali S. Kodialam,et al. Dynamic routing of locally restorable bandwidth guaranteed tunnels using aggregated link usage information , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).
[29] Robert E. Tarjan,et al. A quick method for finding shortest pairs of disjoint paths , 1984, Networks.