Approximations for the disjoint paths problem in high-diameter planar networks
暂无分享,去创建一个
[1] Alan M. Frieze,et al. Existence and Construction of Edge-Disjoint Paths on Expander Graphs , 1994, SIAM J. Comput..
[2] Éva Tardos,et al. Disjoint paths in densely embedded graphs , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.
[3] L. Lovász,et al. Annals of Discrete Mathematics , 1986 .
[4] Alan M. Frieze,et al. Optimal construction of edge-disjoint paths in random graphs , 1994, SODA '94.
[5] J. Edmonds. Minimum partition of a matroid into independent subsets , 1965 .
[6] Alok Aggarwal,et al. Efficient routing and scheduling algorithms for optical networks , 1994, SODA '94.
[7] Yuval Rabani,et al. On-line admission control and circuit routing for high performance computing and communication , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[8] Prabhakar Raghavan,et al. Randomized rounding: A technique for provably good algorithms and algorithmic proofs , 1985, Comb..
[9] MATTHIAS MIDDENDORF,et al. On the complexity of the disjoint paths problem , 1993, Comb..
[10] Eli Upfal,et al. Efficient routing in all-optical networks , 1994, STOC '94.
[11] Karsten Weihe,et al. A Linear-Time Algorithm for Edge-Disjoint Paths in Planar Graphs , 1993, ESA.
[12] Mihalis Yannakakis,et al. Primal-Dual Approximation Algorithms for Integral Flow and Multicut in Trees, with Applications to Matching and Set Cover , 1993, ICALP.
[13] Refael Hassin,et al. On multicommodity flows in planar graphs , 1984, Networks.
[14] Yuval Rabani,et al. Improved bounds for all optical routing , 1995, SODA '95.
[15] Yossi Azar,et al. Throughput-competitive on-line routing , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.
[16] J. Edmonds. Matroid Intersection , 2022 .
[17] Eli Upfal,et al. Constructing disjoint paths on expander graphs , 1987, Comb..
[18] Richard M. Karp,et al. Reducibility among combinatorial problems" in complexity of computer computations , 1972 .
[19] Alan M. Frieze,et al. Existence and construction of edge disjoint paths on expander graphs , 1992, STOC '92.
[20] András Frank. Edge-disjoint paths in planar graphs , 1985, J. Comb. Theory, Ser. B.