1. Graph Algorithms with Small Communication Costs

   • Jieliang Zhou
   • Patrick Dymond
   • Xiaotie Deng

   OriginalPaper Pages: 291 - 305

2. Multi-phase Algorithms for Throughput Maximization for Real-Time Scheduling

   • Piotr Berman
   • Bhaskar Dasgupta

   OriginalPaper Pages: 307 - 323

3. A Probabilistic Feasibility and Value Analysis of the Generalized Assignment Problem

   • H. Edwin Romeijn
   • Nanda Piersma

   OriginalPaper Pages: 325 - 355

4. Polynomial Time Approximation Scheme for the Rectilinear Steiner Arborescence Problem

   • Bing Lu
   • Lu Ruan

   OriginalPaper Pages: 357 - 363

5. Facets of an Assignment Problem with 0–1 Side Constraint

   • Abdo Y. Alfakih
   • Tongnyoul Yi
   • Katta G. Murty

   OriginalPaper Pages: 365 - 388