Ausgabe 2/2013
Special Issue: Approximation Algorithms for Geometric and Combinatorial Problems, a special issue of AAIM 2011
Inhalt (13 Artikel)
Open Access
Online algorithms for 1-space bounded multi dimensional bin packing and hypercube packing
Yong Zhang, Francis Y. L. Chin, Hing-Fung Ting, Xin Han
Online algorithms for maximizing weighted throughput of unit jobs with temperature constraints
Martin Birks, Daniel Cole, Stanley P. Y. Fung, Huichao Xue
On some geometric problems of color-spanning sets
Wenqi Ju, Chenglin Fan, Jun Luo, Binhai Zhu, Ovidiu Daescu
Tight approximation bounds for combinatorial frugal coverage algorithms
Ioannis Caragiannis, Christos Kaklamanis, Maria Kyropoulou
The nearest neighbor Spearman footrule distance for bucket, interval, and partial orders
Franz J. Brandenburg, Andreas Gleißner, Andreas Hofmeier
Open Access
A tight analysis of Brown-Baker-Katseff sequences for online strip packing
W. Kern, J. J. Paulus