{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:30:17Z","timestamp":1760441417262,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319621265"},{"type":"electronic","value":"9783319621272"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-62127-2_32","type":"book-chapter","created":{"date-parts":[[2017,7,4]],"date-time":"2017-07-04T02:47:31Z","timestamp":1499136451000},"page":"373-384","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Split Packing: Packing Circles into Triangles with Optimal Worst-Case Density"],"prefix":"10.1007","author":[{"given":"S\u00e1ndor P.","family":"Fekete","sequence":"first","affiliation":[]},{"given":"Sebastian","family":"Morr","sequence":"additional","affiliation":[]},{"given":"Christian","family":"Scheffer","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,7,5]]},"reference":[{"key":"32_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/978-3-319-18263-6_5","volume-title":"Approximation and Online Algorithms","author":"B Brubach","year":"2015","unstructured":"Brubach, B.: Improved bound for online square-into-square packing. In: Bampis, E., Svensson, O. (eds.) WAOA 2014. LNCS, vol. 8952, pp. 47\u201358. Springer, Cham (2015). doi:10.1007\/978-3-319-18263-6_5"},{"issue":"3","key":"32_CR2","doi-asserted-by":"publisher","first-page":"786","DOI":"10.1016\/j.ejor.2007.01.054","volume":"191","author":"I Castillo","year":"2008","unstructured":"Castillo, I., Kampas, F.J., Pint\u00e9r, J.D.: Solving circle packing problems by global optimization: numerical results and industrial applications. European Journal of Operational Research 191(3), 786\u2013802 (2008)","journal-title":"European Journal of Operational Research"},{"key":"32_CR3","unstructured":"Demaine, E.D., Fekte, S.P., Lang, R.J.: Circle packing for origami design is hard. In: 5th International Conference on Origami in Science, Mathematics and Education, pp. 609\u2013626. AK Peters\/CRC Press (2011)"},{"key":"32_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/978-3-642-40328-6_10","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"SP Fekete","year":"2013","unstructured":"Fekete, S.P., Hoffmann, H.-F.: Online square-into-square packing. In: Raghavendra, P., Raskhodnikova, S., Jansen, K., Rolim, J.D.P. (eds.) APPROX\/RANDOM -2013. LNCS, vol. 8096, pp. 126\u2013141. Springer, Heidelberg (2013). doi:10.1007\/978-3-642-40328-6_10"},{"issue":"3","key":"32_CR5","doi-asserted-by":"publisher","first-page":"867","DOI":"10.1007\/s00453-016-0114-2","volume":"77","author":"SP Fekete","year":"2017","unstructured":"Fekete, S.P., Hoffmann, H.-F.: Online Square-into-Square Packing. Algorithmica 77(3), 867\u2013901 (2017)","journal-title":"Algorithmica"},{"key":"32_CR6","doi-asserted-by":"crossref","unstructured":"Fekete, S.P., Morr, S., Scheffer, C.: Split Packing: Algorithms for Packing Circles with Optimal Worst-Case Density. CoRR abs\/1705.00924 (2017). http:\/\/arxiv.org\/abs\/1705.00924","DOI":"10.1007\/978-3-319-62127-2_32"},{"key":"32_CR7","doi-asserted-by":"crossref","unstructured":"Hifi, M., M\u2019hallah, R.: A literature review on circle and sphere packing problems: models and methodologies. Advances in Operations Research Article ID 150624 (2009)","DOI":"10.1155\/2009\/150624"},{"issue":"5","key":"32_CR8","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1016\/j.ipl.2015.12.007","volume":"116","author":"P Hokama","year":"2016","unstructured":"Hokama, P., Miyazawa, F.K., Schouery, R.C.S.: A bounded space algorithm for online circle packing. Information Processing Letters 116(5), 337\u2013342 (2016). ISSN: 0020\u20130190","journal-title":"Information Processing Letters"},{"key":"32_CR9","doi-asserted-by":"crossref","unstructured":"Lang, R.J.: A computational algorithm for origami design. In: Proceedings of the Twelfth Annual Symposium on Computational Geometry (SoCG), pp. 98\u2013105 (1996)","DOI":"10.1145\/237218.237249"},{"issue":"1","key":"32_CR10","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/S0166-218X(01)00359-6","volume":"122","author":"M Locatelli","year":"2002","unstructured":"Locatelli, M., Raber, U.: Packing equal circles in a square: a deterministic global optimization approach. Discrete Applied Mathematics 122(1), 139\u2013166 (2002)","journal-title":"Discrete Applied Mathematics"},{"key":"32_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1007\/978-3-662-44777-2_59","volume-title":"Algorithms - ESA 2014","author":"FK Miyazawa","year":"2014","unstructured":"Miyazawa, F.K., Pedrosa, L.L.C., Schouery, R.C.S., Sviridenko, M., Wakabayashi, Y.: Polynomial-time approximation schemes for circle packing problems. In: Schulz, A.S., Wagner, D. (eds.) ESA 2014. LNCS, vol. 8737, pp. 713\u2013724. Springer, Heidelberg (2014). doi:10.1007\/978-3-662-44777-2_59"},{"key":"32_CR12","doi-asserted-by":"crossref","unstructured":"Moon, J.W., Moser, L.: Some packing and covering theorems. In: Colloquium Mathematicae, vol. 17(1), pp. 103\u2013110. Institute of Mathematics, Polish Academy of Sciences (1967)","DOI":"10.4064\/cm-17-1-103-110"},{"key":"32_CR13","doi-asserted-by":"crossref","unstructured":"Morr, S.: split packing: an algorithm for packing circles with optimal worst-case density. In: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 99\u2013109 (2017)","DOI":"10.1137\/1.9781611974782.7"},{"key":"32_CR14","doi-asserted-by":"crossref","unstructured":"Peikert, R., W\u00fcrtz, D., Monagan, M., de Groot, C.: Packing circles in a square: A review and new results. In: Proceedings of the 15th IFIP Conference, pp. 45\u201354 (1992)","DOI":"10.1007\/BFb0113271"},{"key":"32_CR15","unstructured":"Specht, E.: Packomania (2015). http:\/\/www.packomania.com\/"},{"issue":"3","key":"32_CR16","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/BF03167582","volume":"21","author":"K Sugihara","year":"2004","unstructured":"Sugihara, K., Sawai, M., Sano, H., Kim, D.-S., Kim, D.: Disk packing for the estimation of the size of a wire bundle. Japan Journal of Industrial and Applied Mathematics 21(3), 259\u2013278 (2004)","journal-title":"Japan Journal of Industrial and Applied Mathematics"},{"key":"32_CR17","unstructured":"Szab\u00f3, P.G., Mark\u00f3t, M.C., Csendes, T., Specht, E., Casado, L.G., Garc\u00eda, I.: New Approaches to Circle Packing in a Square. Springer, US (2007)"},{"issue":"2","key":"32_CR18","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1016\/S0377-2217(01)00241-7","volume":"141","author":"H Wang","year":"2002","unstructured":"Wang, H., Huang, W., Zhang, Q., Xu, D.: An improved algorithm for the packing of unequal circles within a larger containing circle. European Journal of Operational Research 141(2), 440\u2013453 (2002). ISSN: 0377\u20132217","journal-title":"European Journal of Operational Research"},{"key":"32_CR19","unstructured":"W\u00fcrtz, D., Monagan, M., Peikert, R.: The history of packing circles in a square. Maple Technical Newsletter, pp. 35\u201342 (1994)"},{"issue":"2","key":"32_CR20","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/BF02007736","volume":"12","author":"X Yinfeng","year":"1996","unstructured":"Yinfeng, X.: On the minimum distance determined by $$n(\\le $$7) points in an isoscele right triangle. Acta Mathematicae Applicatae Sinica 12(2), 169\u2013175 (1996)","journal-title":"Acta Mathematicae Applicatae Sinica"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-62127-2_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T16:17:50Z","timestamp":1709828270000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-62127-2_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319621265","9783319621272"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-62127-2_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"5 July 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WADS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Workshop on Algorithms and Data Structures","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"St. John's","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 July 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 August 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wads2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.wads.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}