paper.bib

@article{baker1980orthogonal,
  title={Orthogonal packings in two dimensions},
  author={Baker, Brenda S and Coffman, Jr, Edward G and Rivest, Ronald L},
  journal={SIAM Journal on computing},
  volume={9},
  number={4},
  pages={846--855},
  year={1980},
  publisher={SIAM}
}
@article{coffman1980performance,
  title={Performance bounds for level-oriented two-dimensional packing algorithms},
  author={Coffman, Jr, Edward G and Garey, Michael R and Johnson, David S and Tarjan, Robert Endre},
  journal={SIAM Journal on Computing},
  volume={9},
  number={4},
  pages={808--826},
  year={1980},
  publisher={SIAM}
}
@article{johnson1974worst,
  title={Worst-case performance bounds for simple one-dimensional packing algorithms},
  author={Johnson, David S. and Demers, Alan and Ullman, Jeffrey D. and Garey, Michael R and Graham, Ronald L.},
  journal={SIAM Journal on computing},
  volume={3},
  number={4},
  pages={299--325},
  year={1974},
  publisher={SIAM}
}
@InProceedings{approx3okp,
	author="Diedrich, Florian
	and Harren, Rolf
	and Jansen, Klaus
	and Th{\"o}le, Ralf
	and Thomas, Henning",
	editor="Cai, Jin-Yi
	and Cooper, S. Barry
	and Zhu, Hong",
	title="Approximation Algorithms for 3D Orthogonal Knapsack",
	booktitle="Theory and Applications of Models of Computation",
	year="2007",
	publisher="Springer Berlin Heidelberg",
	address="Berlin, Heidelberg",
	pages="34--45",
	abstract="We study non-overlapping axis-parallel packings of 3D boxes with profits into a dedicated bigger box where rotation is forbidden; we wish to maximize the total profit. Since this optimization problem is NP-hard, we focus on approximation algorithms. We obtain fast and simple algorithms with approximation ratios 9{\thinspace}+{\thinspace}$\epsilon$ and 8{\thinspace}+{\thinspace}$\epsilon$ as well as an algorithm with approximation ratio 7{\thinspace}+{\thinspace}$\epsilon$ that uses more sophisticated techniques; these are the smallest approximation ratios known for this problem. Topics: Algorithms, computational and structural complexity.",
	isbn="978-3-540-72504-6"
}
@article{graham1966bounds,
  title={Bounds for certain multiprocessing anomalies},
  author={Graham, Ronald L},
  journal={Bell system technical journal},
  volume={45},
  number={9},
  pages={1563--1581},
  year={1966},
  publisher={Wiley Online Library}
}
@article{steinberg1997strip,
  title={A strip-packing algorithm with absolute performance bound 2},
  author={Steinberg, A},
  journal={SIAM Journal on Computing},
  volume={26},
  number={2},
  pages={401--409},
  year={1997},
  publisher={SIAM}
}
@article{garey1976approximation,
  title={APPROXIMATION ALGORITHMS FOR COMBINATORIAL PROBLEMS: AN ANNOTATED BIBLIOGRAPHY.},
  author={Garey, MR and MR, GAREY and DS, JOHNSON},
  year={1976}
}
@article{hartmanis1982computers,
  title={Computers and intractability: a guide to the theory of np-completeness (michael r. garey and david s. johnson)},
  author={Hartmanis, Juris},
  journal={Siam Review},
  volume={24},
  number={1},
  pages={90},
  year={1982},
  publisher={Society for Industrial and Applied Mathematics}
}
@article{garey1976resource,
  title={Resource constrained scheduling as generalized bin packing},
  author={Garey, Michael R and Graham, Ronald L and Johnson, David S and Yao, Andrew Chi-Chih},
  journal={Journal of Combinatorial Theory, Series A},
  volume={21},
  number={3},
  pages={257--298},
  year={1976},
  publisher={Citeseer}
}