Split Packing: An Algorithm for Packing Circles with Optimal Worst-Case Density

Article Details
Title:	Split Packing: An Algorithm for Packing Circles with Optimal Worst-Case Density
Article URLs:	https://doi.org/10.1137/1.9781611974782.7 http://dl.acm.org/citation.cfm?id=3039693
Alternative Article URLs:
Authors:	Sebastian Morr	TU Braunschweig, Algorithms Group TU Braunschweig, Department of Computer Science
Sharing:	Unknown
Verification:	Author has not verified information
Artifact Evaluation Badge:	none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers:
DBLP Key:	conf/soda/Morr17
Author Comments:

ACM Symposium on Discrete Algorithms, SODA 2017