18 citations · 22 across the 6 of their papers we have counts for
9 papers
A new lower bound for classic online bin packing
János Balogh, József Békési, György Dósa +2
We improve the lower bound on the asymptotic competitive ratio of any online algorithm for bin packing to above 1.54278. We demonstrate for the first time the advantage of branchin…
Lower bounds for several online variants of bin packing
János Balogh, József Békési, György Dósa +2
We consider several previously studied online variants of bin packing and prove new and improved lower bounds on the asymptotic competitive ratios for them. For that, we use a meth…
A new and improved algorithm for online bin packing
János Balogh, József Békési, György Dósa +2
We revisit the classic online bin packing problem. In this problem, items of positive sizes no larger than 1 are presented one by one to be packed into subsets called "bins" of tot…
Online bin packing with cardinality constraints resolved
János Balogh, József Békési, György Dósa +2
Cardinality constrained bin packing or bin packing with cardinality constraints is a basic bin packing problem. In the online version with the parameter k \geq 2, items having size…
Online Algorithms for a Generalized Parallel Machine Scheduling Problem
Istvan Szalkai, Gyorgy Dosa
We consider different online algorithms for a generalized scheduling problem for parallel machines, described in details in the first section. This problem is the generalization of…
Colorful bin packing
Gyorgy Dosa, Leah Epstein
We study a variant of online bin packing, called colorful bin packing. In this problem, items that are presented one by one are to be packed into bins of size 1. Each item i has a…
Online bin packing with cardinality constraints revisited
Gyorgy Dosa, Leah Epstein
Bin packing with cardinality constraints is a bin packing problem where an upper bound k \geq 2 on the number of items packed into each bin is given, in addition to the standard co…
Bin Packing/Covering with Delivery: Some variations, theoretical results and efficient offline algorithms
Gyorgy Dosa, Zsolt Tuza
In the recent paper \cite{BDT10} we introduced a new problem that we call Bin Packing/Covering with Delivery, or BP/CD for short. Mainly we mean under this expression that we look…
Generalized selfish bin packing
Gyorgy Dosa, Leah Epstein
Standard bin packing is the problem of partitioning a set of items with positive sizes no larger than 1 into a minimum number of subsets (called bins) each having a total size of a…