@inproceedings{3105d65f4981403e9f3d50dddae4fbbf,
title = "Multi-tiered algorithms for 2-dimensional bin packing",
abstract = "This research is concerned with approximation algorithms for NP-hard optimization problems on hypercube multiprocessors. We investigate methods of solving such problems, focusing on the tradeoffs in running time, number of active nodes, input size, and accuracy of solution. In this paper, we consider a tiered a l p rithm framework that describes our level algorithms and we expand upon the 2-dimensional bin packing results given in [4]. The major contributions of this paper are data structures which dramatically improve the run time of the first fit and best fit algorithms presented in [4]. The results in this paper were obtained on a 32 node Intel iPSC/2.",
author = "R. Fenrich and R. Miller and Stout, \{Q. F.\}",
note = "Publisher Copyright: {\textcopyright} 1990 IEEE.; 5th Distributed Memory Computing Conference, DMCC 1990 ; Conference date: 08-04-1990 Through 12-04-1990",
year = "1990",
doi = "10.1109/DMCC.1990.555362",
language = "English",
series = "Proceedings of the 5th Distributed Memory Computing Conference, DMCC 1990",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "58--63",
editor = "Walker, \{David W.\} and Stout, \{Quentin F.\}",
booktitle = "Applications",
address = "United States",
}