Sebastian Morr. Split Packing: An Algorithm for Packing Circles with Optimal Worst-Case Density. In Philip N. Klein, editor, Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, Barcelona, Spain, Hotel Porta Fira, January 16-19. pages 99-109, SIAM, 2017. [doi]
@inproceedings{Morr17, title = {Split Packing: An Algorithm for Packing Circles with Optimal Worst-Case Density}, author = {Sebastian Morr}, year = {2017}, doi = {10.1137/1.9781611974782.7}, url = {http://dx.doi.org/10.1137/1.9781611974782.7}, researchr = {https://researchr.org/publication/Morr17}, cites = {0}, citedby = {0}, pages = {99-109}, booktitle = {Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, Barcelona, Spain, Hotel Porta Fira, January 16-19}, editor = {Philip N. Klein}, publisher = {SIAM}, isbn = {978-1-61197-478-2}, }