文章基本信息

标题：Placing your Coins on a Shelf
本地全文：下载
作者：Helmut Alt ; Kevin Buchin ; Steven Chaplick 等
期刊名称：LIPIcs : Leibniz International Proceedings in Informatics
电子版ISSN：1868-8969
出版年度：2017
卷号：92
页码：4:1-4:12
DOI：10.4230/LIPIcs.ISAAC.2017.4
出版社：Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
摘要：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.
关键词：packing problems; approximation algorithms; NP-hardness