A Faster Algorithm for Computing Minimum 5-Way and 6-Way Cuts in Graphs Hiroshi NagamochiShigeki KatayamaToshihide Ibaraki OriginalPaper Pages: 151 - 169
Approximation Algorithms for the Multiple Knapsack Problem with Assignment Restrictions M. DawandeJ. KalagnanamR. Ravi OriginalPaper Pages: 171 - 186
On the Complexity of the Steiner Problem M. BrazilD.A. ThomasJ.F. Weng OriginalPaper Pages: 187 - 195
A Semidefinite Programming Approach to the Quadratic Knapsack Problem C. HelmbergF. RendlR. Weismantel OriginalPaper Pages: 197 - 215
An Efficient Algorithm for Delay Buffer Minimization Guoliang XueShangzhi SunLojun Shi OriginalPaper Pages: 217 - 233
On Integrality, Stability and Composition of Dicycle Packings and Covers Zeev NutovMichal Penn OriginalPaper Pages: 235 - 251
Combining Linear and Non-Linear Objectives in Spanning Tree Problems Mauro Dell'AmicoFrancesco Maffioli OriginalPaper Pages: 253 - 269