1. Geometry Helps in Bottleneck Matching and Related Problems

   • A. Efrat
   • A. Itai
   • M. J. Katz

   OriginalPaper Pages: 1 - 28

2. On-Line Competitive Algorithms for Call Admission in Optical Networks

   • B. Awerbuch
   • Y. Azar
   • A. Rosén

   OriginalPaper Pages: 29 - 43

3. Permutation Routing on Reconfigurable Meshes

   • J. C. Cogolludo
   • S. Rajasekaran

   OriginalPaper Pages: 44 - 57

4. Approximation Algorithms for Degree-Constrained Minimum-Cost Network-Design Problems

   • R. Ravi
   • M. V. Marathe
   • H. B. Hunt III

   OriginalPaper Pages: 58 - 78

5. Inapproximability Results for Guarding Polygons and Terrains

   • S. Eidenbenz
   • C. Stamm
   • P. Widmayer

   OriginalPaper Pages: 79 - 113