On the Worst-case Performance of the Sum-of-Squares Algorithm for Bin Packing

Autor: Csirik, Janos, Johnson, David S., Kenyon, Claire

The Sum of Squares algorithm for bin packing was defined in [2] and studied in great detail in [1], where it was proved that its worst case performance ratio is at most 3. In this note, we improve the asymptotic worst case bound to 2.7777...

Externí odkaz: http://arxiv.org/abs/cs/0509031

On the genera of X_0(N)

Autor: Csirik, János A., Wetherell, Joseph L., Zieve, Michael E.

Let g_0(N) be the genus of the modular curve X_0(N). We record several properties of the sequence {g_0(N)}. Even though the average size of g_0(N) is 1.25N/pi^2, a random positive integer has probability zero of being a value of g_0(N). Also, if N is

Externí odkaz: http://arxiv.org/abs/math/0006096

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

Variable Sized Bin Packing and Bin Covering *

Autor: Csirik János

Publikováno v: Handbook of Approximation Algorithms and Metaheuristics, Second Edition ISBN: 9781351236423
Handbook of Approximation Algorithms and Metaheuristics

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::68d9055330c1f384068fe6d50928622c
https://doi.org/10.1201/9781351236423-30

Resource augmentation for online bounded space bin packing

Autor: Csirik, János, Woeginger, Gerhard J.

Publikováno v: In Journal of Algorithms 2002 44(2):308-320