✦ LIBER ✦
Fast Algorithms for Finding O(Congestion + Dilation) Packet Routing Schedules
✍ Scribed by Tom Leighton; Bruce Maggs; Andréa W. Richa
- Publisher
- Springer-Verlag
- Year
- 1999
- Tongue
- English
- Weight
- 364 KB
- Volume
- 19
- Category
- Article
- ISSN
- 0209-9683
No coin nor oath required. For personal study only.