Ausgabe 2/2000
Inhalt (8 Artikel)
A Faster Algorithm for Computing Minimum 5-Way and 6-Way Cuts in Graphs
Hiroshi Nagamochi, Shigeki Katayama, Toshihide Ibaraki
Approximation Algorithms for the Multiple Knapsack Problem with Assignment Restrictions
M. Dawande, J. Kalagnanam, P. Keskinocak, F.S. Salman, R. Ravi
A Semidefinite Programming Approach to the Quadratic Knapsack Problem
C. Helmberg, F. Rendl, R. Weismantel
An Efficient Algorithm for Delay Buffer Minimization
Guoliang Xue, Shangzhi Sun, David H.C. Du, Lojun Shi
Combining Linear and Non-Linear Objectives in Spanning Tree Problems
Mauro Dell'Amico, Francesco Maffioli