Placing your coins on a shelf

DOI10.20382/JOCG.V9I1A10zbMATH Open1417.68221OpenAlexW4298081514MaRDI QIDQ4626296FDOQ4626296

Authors: Helmut Alt, Kevin Buchin, Steven Chaplick, Philipp Kindermann, Christian Knauer, Fabian Stehn, Otfried Cheong 

Publication date: 27 February 2019

Full work available at URL: http://arxiv.org/abs/1707.01239

Recommendations

• Placing your coins on a shelf
• Packing 2D disks into a 3D container
• Polynomial-time approximation schemes for circle and other packing problems
• A POLYNOMIAL-TIME APPROXIMATION ALGORITHM FOR A GEOMETRIC DISPERSION PROBLEM
• A Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Cited In (1)

• Placing your coins on a shelf

This page was built for publication: Placing your coins on a shelf

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4626296)