English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse
  1. View item / 
  2. Item Summary

Item

ITEM ACTIONSEXPORT
Add to Basket
  DetailsSummary

Released
Conference Paper

On Guillotine Cutting Sequences

MPS-Authors
/persons/resource/persons43960

Abed,  Fidaa
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons44225

Chalermsook,  Parinya
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons44737

Karrenbauer,  Andreas
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45742

Wiese,  Andreas
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

http://drops.dagstuhl.de/opus/volltexte/2015/5291/
(Publisher version)

http://drops.dagstuhl.de/doku/urheberrecht1.html
(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

Abed, F., Chalermsook, P., Correa, J., Karrenbauer, A., Pérez-Lantero, P., Soto, J. A., et al. (2015). On Guillotine Cutting Sequences. In N. Garg, K. Jansen, A. Rau, & J. D. P. Rolim (Eds.), Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (pp. 1-19). Wadern: Schloss Dagstuhl. doi:10.4230/LIPIcs.APPROX-RANDOM.2015.1.


Cite as: https://hdl.handle.net/11858/00-001M-0000-0028-8F71-7
Abstract
There is no abstract available