How Does Object Fatness Impact the Complexity of Packing in d Dimensions?

Kisfaludi-Bak, Sándor; Marx, Dániel; van der Zanden, Tom C.

doi:10.4230/LIPIcs.ISAAC.2019.36

Item

ITEM ACTIONSEXPORT

Add to Basket

Please note that a newer version of this item is available:
https://pure.mpg.de/pubman/item/item_3266053_4

DetailsSummary

Released

Conference Paper

How Does Object Fatness Impact the Complexity of Packing in d Dimensions?

MPS-Authors

/persons/resource/persons252857

Kisfaludi-Bak, Sándor
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons250066

Marx, Dániel
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

https://drops.dagstuhl.de/opus/volltexte/2019/11532/
(Publisher version)

https://creativecommons.org/licenses/by/3.0/legalcode
(Copyright transfer agreement)

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

Kisfaludi-Bak, S., Marx, D., & van der Zanden, T. C. (2019). How Does Object Fatness Impact the Complexity of Packing in d Dimensions? In P. Lu, & G. Zhang (Eds.), 30th International Symposium on Algorithms and Computation (pp. 1-18). Wadern: Schloss Dagstuhl. doi:10.4230/LIPIcs.ISAAC.2019.36.

Cite as: https://hdl.handle.net/21.11116/0000-0007-7785-D

Abstract

There is no abstract available