Sunday, January 17
Session 3
Routing
9:00 AM-10:40 AM
Room: Carroll
Chair: S. Muthukrishnan, Bell Laboratories, Lucent Technologies
- 9:00-9:17 An O(\sqrt N) Oblivious Routing Algorithm for 2-D
Meshes of Constant Queue-Size
- Kazuo Iwama, Kyoto University, Japan; and Eiji Miyano, Kyushu
Institute of Design, Fukuoka, Japan
- 9:20-9:37 Compact Routing with Minimum Stretch
- Lenore J. Cowen, Johns Hopkins University
- 9:40-9:57 Compact Roundtrip Routing for Digraphs
- Lenore J. Cowen and Christopher G. Wagner, Johns Hopkins University
- 10:00-10:17 A Deterministic Approximation Algorithm for a
Minmax Integer Programming Problem
- Chi-Jen Lu, University of Massachusetts, Amherst
- 10:20-10:37 Locally Efficient Online Strategies for Routing
Packets along Fixed Paths
- Petra Berenbrink and Christian Scheideler, Paderborn University, Germany
tjf, 9/11/98; MMD, 10/16/98