Ausgabe 3/2004
Inhalt (8 Artikel)
On Approximate Graph Colouring and MAX-k-CUT Algorithms Based on the θ-Function
E. de Klerk, D.V. Pasechnik, J.P. Warners
Pipage Rounding: A New Method of Constructing Algorithms with Proven Performance Guarantee
A.A. Ageev, M.I. Sviridenko
Models and Bounds for Two-Dimensional Level Packing Problems
Andrea Lodi, Silvano Martello, Daniele Vigo