Fully dynamic algorithms for bin packing: Being (mostly) myopic helps

SIAM Journal on Computing

Volumn 28, Issue 2, 1998, Pages 574-611

  Ivković, Zoran ^a  

^a YALE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY;

BIN PACKING; FULLY DYNAMIC ALGORITHMS;

APPROXIMATION THEORY;

EID: 0032108003     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539794276749     Document Type: Article

References (2)

1. R. J. ANDERSON, B. W. MAYR, AND M. K. WARMUTH (1983), Parallel approximation algorithms for bin packing, Inform, and Comput., 82, pp. 262-277.
2. E. G. COFFMAN, M. R. GAREY, AND D. S. JOHNSON (1983), Dynamic bin packing, SIAM J. Comput., 12, pp. 227-258.