Gábor Galambos
Gábor Galambos
Professor, University of Szeged
E-mail confirmado em jgypk.szte.hu
Título
Citado por
Citado por
Ano
Bin packing approximation algorithms: survey and classification
EG Coffman, J Csirik, G Galambos, S Martello, D Vigo
Handbook of combinatorial optimization, 455-531, 2013
2212013
Bin packing approximation algorithms: Combinatorial analysis
EG Coffman, G Galambos, S Martello, D Vigo
Handbook of combinatorial optimization, 151-207, 1999
1681999
An on-line scheduling heuristic with better worst-case ratio than Graham’s list scheduling
G Galambos, GJ Woeginger
SIAM Journal on Computing 22 (2), 349-355, 1993
1321993
On-line bin packing—a restricted survey
G Galambos, GJ Woeginger
Zeitschrift für Operations Research 42 (1), 25-45, 1995
931995
New lower bounds for certain classes of bin packing algorithms
J Balogh, J Békési, G Galambos
Theoretical Computer Science 440, 1-13, 2012
782012
Hybrid next-fit algorithm for the two-dimensional rectangle bin-packing problem
JBG Frenk, G Galambos
Computing 39 (3), 201-217, 1987
651987
Probabilistic analysis of algorithms for dual bin packing problems
J Csirik, JBG Frenk, G Galambos, AHGR Kan
Journal of Algorithms 12 (2), 189-203, 1991
591991
An exact algorithm for scheduling identical coupled tasks
D Ahr, J Békési, G Galambos, M Oswald, G Reinelt
Mathematical Methods of Operations Research 59 (2), 193-203, 2004
572004
Repacking helps in bounded space on-line bind-packing
G Galambos, GJ Woeginger
Computing 49 (4), 329-338, 1993
491993
A 5/4 linear time bin packing algorithm
J Békési, G Galambos, H Kellerer
Journal of Computer and System Sciences 60 (1), 145-160, 2000
362000
Lower bounds for 1-, 2-and 3-dimensional on-line bin packing algorithms
G Galambos, A van Vliet
Computing 52 (3), 281-297, 1994
321994
Lower bound for the online bin packing problem with restricted repacking
J Balogh, J Békési, G Galambos, G Reinelt
SIAM Journal on Computing 38 (1), 398-410, 2008
292008
A probabilistic analysis of the next fit decreasing bin packing heuristic
J Csirik, G Galambos, H Frenk, AM Frieze, A Rinnooy Kan
Operations Research Letters 5 (5), 233-236, 1986
291986
A lower bound for on-line vector-packing algorithms
G Galambos, H Kellerer, GJ Woeginger
Acta Cybernetica 11 (1-2), 23-34, 1993
281993
New lower bounds for certain classes of bin packing algorithms
J Balogh, J Békési, G Galambos
International Workshop on Approximation and Online Algorithms, 25-36, 2010
272010
A 1.6 lower-bound for the two-dimensional on-line rectangle bin-packing
G Galambos
Acta Cybernetica 10 (1-2), 21-24, 1991
261991
Parametric lower bound for on-line bin-packing
G Galambos
SIAM Journal on Algebraic Discrete Methods 7 (3), 362-367, 1986
201986
On-line bin packing with restricted repacking
J Balogh, J Békési, G Galambos, G Reinelt
Journal of Combinatorial Optimization 27 (1), 115-131, 2014
192014
Improved analysis of an algorithm for the coupled task problem with UET jobs
J Békési, G Galambos, M Oswald, G Reinelt
Operations Research Letters 37 (2), 93-96, 2009
152009
A simple proof of Liang's lower bound for on-line bin packing and the extension to the parametric case
G Galambos, JBG Frenk
Discrete Applied Mathematics 41 (2), 173-178, 1993
151993
O sistema não pode executar a operação agora. Tente novamente mais tarde.
Artigos 1–20