Veröffentlichung

Titel:

Placing your Coins on a Shelf

AutorInnen:

Helmut Alt
Kevin Buchin
Stephen Chaplick
Otfried Cheong
Philipp Kindermann
Christian Knauer
Fabian Stehn

Kategorie:

Konferenzbandbeiträge

erschienen in:

Proceedings of the 28th International Symposium on Algorithms and Computation (ISAAC'17), pp. 4:1-4:12

Abstract:

We consider the problem of packing a family of disks "on a shelf", that is, such that each disk touches the x-axis from above and such that no two disks overlap. We prove that the problem of minimizing the distance between the leftmost point and the rightmost point of any disk is NP-hard. On the positive side, we show how to approximate this problem within a factor of 4/3 in O(n log n) time, and provide an O(n log n)-time exact algorithm for a special case, in particular when the ratio between the largest and smallest radius is at most four.

Download:

DROPS

BibTeX-Eintrag:

@InProceedings{abcckks-pycos-isaac17, author = {Helmut Alt and Kevin Buchin and Steven Chaplick and Otfried Cheong and Philipp Kindermann and Christian Knauer and Fabian Stehn}, title = {Placing your Coins on a Shelf}, booktitle = {Proc. 28th International Symposium on Algorithms and Computation (ISAAC'17)}, year = {2017}, editor = {Yoshio Okamoto and Takeshi Tokuyama}, volume = {92}, series = {LIPIcs}, pages = {4:1--4:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik}, abstract = {We consider the problem of packing a family of disks "on a shelf", that is, such that each disk touches the $x$-axis from above and such that no two disks overlap. We prove that the problem of minimizing the distance between the leftmost point and the rightmost point of any disk is NP-hard. On the positive side, we show how to approximate this problem within a factor of 4/3 in $O(n \log n)$ time, and provide an $O(n \log n)$-time exact algorithm for a special case, in particular when the ratio between the largest and smallest radius is at most four.}, }