论文信息 - The Disjoint Paths Problem - 字舞流文

The Disjoint Paths Problem

[1] Éva Tardos,et al. Disjoint paths in densely embedded graphs , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[2] Éva Tardos,et al. Approximations for the disjoint paths problem in high-diameter planar networks , 1995, STOC '95.

[3] Yuval Rabani,et al. Improved bounds for all optical routing , 1995, SODA '95.

[4] 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.

[5] Alan M. Frieze,et al. Existence and Construction of Edge-Disjoint Paths on Expander Graphs , 1994, SIAM J. Comput..

[6] Mihalis Yannakakis,et al. Primal-Dual Approximation Algorithms for Integral Flow and Multicut in Trees, with Applications to Matching and Set Cover , 1993, ICALP.

[7] Prabhakar Raghavan,et al. Randomized rounding: A technique for provably good algorithms and algorithmic proofs , 1985, Comb..

[8] Prabhakar Raghavan,et al. Probabilistic construction of deterministic algorithms: Approximating packing integer programs , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).