A practical algorithm for constructing oblivious routing schemes
暂无分享,去创建一个
Marcin Bienkowski | Harald Räcke | Miroslaw Korzeniowski | Harald Räcke | M. Korzeniowski | Marcin Bienkowski
[1] Philip N. Klein,et al. Excluded minors, network decomposition, and multicommodity flow , 1993, STOC.
[2] Allan Borodin,et al. Routing, merging and sorting on parallel models of computation , 1982, STOC '82.
[3] Harald Räcke,et al. Minimizing Congestion in General Networks , 2002, FOCS.
[4] G. Miller,et al. Solving Symmetric Diagonally-Dominant Systems by Preconditioning , 2003 .
[5] Amos Fiat,et al. On-line load balancing with applications to machine scheduling and virtual circuit routing , 1993, STOC.
[6] Yossi Azar,et al. Local optimization of global objectives: competitive distributed deadlock resolution and resource allocation , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[7] Christos Kaklamanis,et al. Tight bounds for oblivious routing in the hypercube , 1990, SPAA '90.
[8] Prabhakar Raghavan,et al. Randomized rounding: A technique for provably good algorithms and algorithmic proofs , 1985, Comb..
[9] Allan Borodin,et al. Routing, Merging, and Sorting on Parallel Models of Computation , 1985, J. Comput. Syst. Sci..
[10] Ojas Parekh,et al. Finding effective support-tree preconditioners , 2005, SPAA '05.
[11] B. E. Eckbo,et al. Appendix , 1826, Epilepsy Research.
[12] Leslie G. Valiant,et al. Universal schemes for parallel communication , 1981, STOC '81.
[13] Yuval Rabani,et al. An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm , 1998, SIAM J. Comput..
[14] Satish Rao,et al. A polynomial-time tree decomposition to minimize congestion , 2003, SPAA '03.
[15] Edith Cohen,et al. Optimal oblivious routing in polynomial time , 2003, STOC '03.