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

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]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.