English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Journal Article

Two for One: Tight Approximation of 2D Bin Packing

MPS-Authors
/persons/resource/persons44587

Harren,  Rolf
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons44695

Jansen,  Klaus
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45543

van Stee,  Rob
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Harren, R., Jansen, K., Prädel, L., Schwarz, U. M., & van Stee, R. (2013). Two for One: Tight Approximation of 2D Bin Packing. International Journal of Foundations of Computer Science, 24(8), 1299-1328. doi:10.1142/S0129054113500354.


Cite as: https://hdl.handle.net/11858/00-001M-0000-0024-5B39-E
Abstract
There is no abstract available