@inproceedings{f02ccedfaea54324af36d8fb9609c3e6,
title = "Placing your Coins on a Shelf",
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.",
author = "Helmut Alt and Kevin Buchin and Steven Chaplick and Otfried Cheong and Philipp Kindermann and Christian Knauer and Fabian Stehn",
note = "DBLP's bibliographic metadata records provided through http://dblp.org/search/publ/api are distributed under a Creative Commons CC0 1.0 Universal Public Domain Dedication. Although the bibliographic metadata records are provided consistent with CC0 1.0 Dedication, the content described by the metadata records is not. Content may be subject to copyright, rights of privacy, rights of publicity and other restrictions.",
year = "2017",
doi = "10.4230/LIPICS.ISAAC.2017.4",
language = "English",
volume = "92",
series = "Leibniz International Proceedings in Informatics (LIPIcs)",
publisher = "Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik",
pages = "4:1--4:12",
editor = "Yoshio Okamoto and Takeshi Tokuyama",
booktitle = "28th International Symposium on Algorithms and Computation (ISAAC 2017)",
address = "Germany",
}