San Francisco / Springer-Verlag / Newark / Elsevier / Philadelphia / Montvale / Evanston / Urbana / New York / La Jolla / Athens / Berlin / Cambridge / Beijing / San Diego / Wiley / /
Company
E. G. Co / AFIPS Press / W. H. Freeman and Co. / IEEE Computer Society Press / H. L. Ong / ACM Press / Coordinated Science Laboratory / Algorithms / /
Country
Netherlands / China / Singapore / Greece / /
Facility
Institute of Applied Mathematics / Northwestern University / University of Illinois / University of California / Princeton University / University of Delaware / Erasmus University / Massachusetts Institute of Technology / University of California at Irvine / /
IndustryTerm
related packing algorithms / parallel algorithms / heuristic bin packing algorithms / ellipsoid algorithm / online bin packing / harmonic-based bin packing algorithms / bin packing algorithm / on-line bin packing algorithms / bin-packing algorithm / dynamic algorithms / monotone algorithm / on-line algorithms / on-line bin-packing / bin-packing solutions / bin packing algorithms / memory allocation algorithms / on-line packing algorithm / On-line bin packing / modi ed harmonic algorithm / possible algorithm / linear time bin-packing algorithm / semi-online algorithm / stochastic online bin packing algorithms / Approximation algorithms / Fit algorithm / bin-packing algorithms / bounded space on-line bin-packing / average-case on-line bin packing / linear time algorithm / compound bin-packing algorithm / space on-line bin packing / memory allocation algorithm / /
MarketIndex
INDEX / /
Organization
University of California / Princeton University / Massachusetts Institute of Technology / Society for Industrial and Applied Mathematics / Department of Computer Science and Engineering / Computer Science Division / J. Assoc. / Department of Computer and Information Sciences / Chinese Academy of Sciences / Northwestern University / Erasmus University / Rotterdam / Department of Mathematics / Department of Electrical Engineering and Computer Science / University of Delaware / University of Illinois / Department of Information and Computer Science / Institute of Applied Mathematics / /
Person
M. Hofri / F. T. Leighton / C. C. McGeoch / D. J. Kleitman / A. C. Yao / J. L. Bentley / A. Demers / S. Hal asz / Jr / C. Kenyon / M. R. Garey / R. L. Graham / L. A. McGeogh / P. W. Shor / G. Galambos / J. Y-T / G. S. Lueker / N. Young / R. R. Weber / M. Yannakakis / J. D. Ullman / W. Fernandez de la Vega / C. Courcoubetis / K. So / L. A. McGeoch / D. J. Brown / C. C. Lee / S. B. Assman / H. W. Lenstra / Jr. / K. Tsuga / D. T. Lee / P. Ramanan / D. S. Johnson / D. P. Bovet / J. Csirik / /
Position
editor / /
Product
Fit / /
ProvinceOrState
New York / California / New Jersey / Illinois / Newfoundland / Delaware / Massachusetts / /
PublishedMedium
the Theory of Computing / Theory of Computing / Lecture Notes in Computer Science / /
Technology
36 randomized algorithm / related packing algorithms / decreasing algorithm / 15 parallel algorithms / 8 Any Fit algorithm / on-line packing algorithm / stochastic online bin packing algorithms / J. Algorithms / decreasing bin packing algorithm / 2 APPROXIMATION ALGORITHMS / linear time bin-packing algorithm / on-line one-dimensional bin packing algorithms / one-dimensional packing algorithms / Approximation Algorithms / linear time algorithm / memory allocation algorithms / compound bin-packing algorithm / on-line bin packing algorithms / on-line algorithms / bin packing algorithms / 29 closed algorithms / memory allocation algorithm / bin-packing algorithms / two-dimensional bin packing algorithms / 38 semi-online algorithm / 45 algorithms / 44 monotone algorithm / 18 Harmonic algorithms / bin-packing algorithm / bin packing algorithm / modi ed harmonic algorithm / Fit algorithm / harmonic-based bin packing algorithms / heuristic bin packing algorithms / /
INDEX Next Fit, 4{5, 25, 27{30 Smart, 28, 30 Next Fit Decreasing, 17, 41, 44 Next-K Fit, 5, 9{11, 25, 28