{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T08:07:19Z","timestamp":1743149239157,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319774039"},{"type":"electronic","value":"9783319774046"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-319-77404-6_54","type":"book-chapter","created":{"date-parts":[[2018,3,12]],"date-time":"2018-03-12T10:03:11Z","timestamp":1520848991000},"page":"741-754","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Two-Dimensional Knapsack for Circles"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0602-6298","authenticated-orcid":false,"given":"Carla Negri","family":"Lintzmayer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1067-6421","authenticated-orcid":false,"given":"Fl\u00e1vio Keidi","family":"Miyazawa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eduardo Candido","family":"Xavier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,3,13]]},"reference":[{"key":"54_CR1","doi-asserted-by":"crossref","unstructured":"Adamaszek, A., Wiese, A.: A quasi-PTAS for the two-dimensional geometric Knapsack problem. In: Proceedings of the 26th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2015), pp. 1491\u20131505. Society for Industrial and Applied Mathematics, Philadelphia (2015)","DOI":"10.1137\/1.9781611973730.98"},{"key":"54_CR2","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/j.cosrev.2016.12.001","volume":"24","author":"HI Christensen","year":"2017","unstructured":"Christensen, H.I., Khan, A., Pokutta, S., Tetali, P.: Approximation and online algorithms for multidimensional bin packing: a survey. Comput. Sci. Rev. 24, 63\u201379 (2017)","journal-title":"Comput. Sci. Rev."},{"key":"54_CR3","volume-title":"Circle Packing for Origami Design Is Hard","author":"ED Demaine","year":"2010","unstructured":"Demaine, E.D., Fekete, S.P., Lang, R.J.: Circle Packing for Origami Design Is Hard. A K Peters\/CRC Press, Singapore (2010). pp. 609\u2013626"},{"key":"54_CR4","unstructured":"Fishkin, A.V., Gerber, O., Jansen, K., Solis-Oba, R.: On packing squares with resource augmentation: maximizing the profit. In: Proceedings of the 2005 Australasian Symposium on Theory of Computing (CATS 2005), pp. 61\u201367. Australian Computer Society Inc., Darlinghurst (2005)"},{"key":"54_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1007\/11549345_31","volume-title":"Mathematical Foundations of Computer Science 2005","author":"AV Fishkin","year":"2005","unstructured":"Fishkin, A.V., Gerber, O., Jansen, K., Solis-Oba, R.: Packing weighted rectangles into a square. In: J\u0229drzejowicz, J., Szepietowski, A. (eds.) MFCS 2005. LNCS, vol. 3618, pp. 352\u2013363. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11549345_31"},{"key":"54_CR6","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1979)"},{"key":"54_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/2009\/150624","volume":"2009","author":"M Hifi","year":"2009","unstructured":"Hifi, M., M\u2019Hallah, R.: A literature review on circle and sphere packing problems: models and methodologies. Adv. Oper. Res. 2009, 1\u201322 (2009)","journal-title":"Adv. Oper. Res."},{"issue":"5","key":"54_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. Inf. Process. Lett. 116(5), 337\u2013342 (2016)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"54_CR9","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1137\/080717110","volume":"26","author":"K Jansen","year":"2012","unstructured":"Jansen, K., Solis-Oba, R.: Packing squares with profits. SIAM J. Discret. Math. 26(1), 263\u2013279 (2012)","journal-title":"SIAM J. Discret. Math."},{"issue":"3","key":"54_CR10","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/s00453-006-0194-5","volume":"47","author":"K Jansen","year":"2007","unstructured":"Jansen, K., Zhang, G.: Maximizing the total profit of rectangles packed into a rectangle. Algorithmica 47(3), 323\u2013342 (2007)","journal-title":"Algorithmica"},{"issue":"4","key":"54_CR11","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1287\/moor.8.4.538","volume":"8","author":"HW Lenstra","year":"1983","unstructured":"Lenstra, H.W.: Integer programming with a fixed number of variables. Math. Oper. Res. 8(4), 538\u2013548 (1983)","journal-title":"Math. Oper. Res."},{"key":"54_CR12","first-page":"107","volume-title":"Two-Dimensional Bin Packing Problems","author":"A Lodi","year":"2013","unstructured":"Lodi, A., Martello, S., Monaci, M., Vigo, D.: Two-Dimensional Bin Packing Problems, pp. 107\u2013129. Wiley, Hoboken (2013)"},{"issue":"2","key":"54_CR13","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/S0021-9800(68)80047-X","volume":"5","author":"A Meir","year":"1968","unstructured":"Meir, A., Moser, L.: On packing of squares and cubes. J. Comb. Theory 5(2), 126\u2013134 (1968)","journal-title":"J. Comb. Theory"},{"issue":"2","key":"54_CR14","doi-asserted-by":"publisher","first-page":"536","DOI":"10.1007\/s00453-015-0052-4","volume":"76","author":"FK Miyazawa","year":"2016","unstructured":"Miyazawa, F.K., Pedrosa, L.L.C., Schouery, R.C.S., Sviridenko, M., Wakabayashi, Y.: Polynomial-time approximation schemes for circle and other packing problems. Algorithmica 76(2), 536\u2013568 (2016)","journal-title":"Algorithmica"},{"key":"54_CR15","series-title":"Springer Optimization and its Applications","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-45676-8","volume-title":"New Approaches to Circle Packing in a Square","author":"PG Szab\u00f3","year":"2007","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 Optimization and its Applications. Springer, New York (2007). https:\/\/doi.org\/10.1007\/978-0-387-45676-8"}],"container-title":["Lecture Notes in Computer Science","LATIN 2018: Theoretical Informatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-77404-6_54","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T16:04:44Z","timestamp":1709827484000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-77404-6_54"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319774039","9783319774046"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-77404-6_54","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"13 March 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LATIN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Latin American Symposium on Theoretical Informatics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Buenos Aires","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Argentina","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 April 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 April 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"latin2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/latin2018.dc.uba.ar\/#","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}