Optimal oblivious routing in polynomial time
- 9 June 2003
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 383-388
- https://doi.org/10.1145/780542.780599
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Making intra-domain routing robust to changing and uncertain traffic demandsPublished by Association for Computing Machinery (ACM) ,2003
- Local optimization of global objectives: competitive distributed deadlock resolution and resource allocationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Measuring ISP topologies with rocketfuelPublished by Association for Computing Machinery (ACM) ,2002
- On-line network routingPublished by Springer Nature ,1998
- 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 hypercubePublished by Association for Computing Machinery (ACM) ,1990
- Geometric Algorithms and Combinatorial OptimizationPublished by Springer Nature ,1988
- 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 communicationPublished by Association for Computing Machinery (ACM) ,1981