1. A Faster Algorithm for Computing Minimum 5-Way and 6-Way Cuts in Graphs

   • Hiroshi Nagamochi
   • Shigeki Katayama
   • Toshihide Ibaraki

   OriginalPaper Pages: 151 - 169

2. Approximation Algorithms for the Multiple Knapsack Problem with Assignment Restrictions

   • M. Dawande
   • J. Kalagnanam
   • R. Ravi

   OriginalPaper Pages: 171 - 186

3. On the Complexity of the Steiner Problem

   • M. Brazil
   • D.A. Thomas
   • J.F. Weng

   OriginalPaper Pages: 187 - 195

4. A Semidefinite Programming Approach to the Quadratic Knapsack Problem

   • C. Helmberg
   • F. Rendl
   • R. Weismantel

   OriginalPaper Pages: 197 - 215

5. An Efficient Algorithm for Delay Buffer Minimization

   • Guoliang Xue
   • Shangzhi Sun
   • Lojun Shi

   OriginalPaper Pages: 217 - 233

6. On Integrality, Stability and Composition of Dicycle Packings and Covers

   • Zeev Nutov
   • Michal Penn

   OriginalPaper Pages: 235 - 251

7. Combining Linear and Non-Linear Objectives in Spanning Tree Problems

   • Mauro Dell'Amico
   • Francesco Maffioli

   OriginalPaper Pages: 253 - 269

8. A 75° Angle Constraint for Plane Minimal T1 Trees

   • T. Cole

   OriginalPaper Pages: 271 - 284