Optimal oblivious routing in polynomial time
Authors:
Open Access
- 9 June 2003
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 383-388
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Making intra-domain routing robust to changing and uncertain traffic demands2003
- Local optimization of global objectives: competitive distributed deadlock resolution and resource allocation2002
- Measuring ISP topologies with rocketfuel2002
- On-line network routing1998
- On-line routing of virtual circuits with applications to load balancing and machine schedulingJournal of the ACM, 1997
- Tight bounds for oblivious routing in the hypercube1990
- Geometric Algorithms and Combinatorial Optimization1988
- Randomized rounding: A technique for provably good algorithms and algorithmic proofsCombinatorica, 1987
- Routing, merging, and sorting on parallel models of computationJournal of Computer and System Sciences, 1985
- Universal schemes for parallel communication1981