Approximations for the Disjoint Paths Problem in High-Diameter Planar Networks
暂无分享,去创建一个
[1] Prabhakar Raghavan,et al. Randomized rounding: A technique for provably good algorithms and algorithmic proofs , 1985, Comb..
[2] Yuval Rabani,et al. Improved bounds for all optical routing , 1995, SODA '95.
[3] Eli Upfal,et al. Constructing disjoint paths on expander graphs , 1987, Comb..
[4] Alok Aggarwal,et al. Efficient routing and scheduling algorithms for optical networks , 1994, SODA '94.
[5] Raymond E. Miller,et al. Complexity of Computer Computations , 1972 .
[6] Haruko Okamura,et al. Multicommodity flows in planar graphs , 1981, J. Comb. Theory, Ser. B.
[7] Colin McDiarmid,et al. Disjoint Common Transversals and Exchange Structures , 1976 .
[8] 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.
[9] Éva Tardos,et al. Disjoint paths in densely embedded graphs , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.
[10] Alan M. Frieze,et al. Existence and construction of edge disjoint paths on expander graphs , 1992, STOC '92.
[11] Alexander Schrijver,et al. Paths, Flows, and VLSI-Layout , 1990 .
[12] Alan M. Frieze,et al. Optimal construction of edge-disjoint paths in random graphs , 1994, SODA '94.
[13] J. Edmonds. Minimum partition of a matroid into independent subsets , 1965 .
[14] MATTHIAS MIDDENDORF,et al. On the complexity of the disjoint paths problem , 1993, Comb..
[15] Mihalis Yannakakis,et al. Primal-Dual Approximation Algorithms for Integral Flow and Multicut in Trees, with Applications to Matching and Set Cover , 1993, ICALP.
[16] Prabhakar Raghavan,et al. Probabilistic construction of deterministic algorithms: Approximating packing integer programs , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).
[17] András Frank. Edge-disjoint paths in planar graphs , 1985, J. Comb. Theory, Ser. B.