{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T21:42:05Z","timestamp":1742938925402,"version":"3.40.3"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031498145"},{"type":"electronic","value":"9783031498152"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-49815-2_11","type":"book-chapter","created":{"date-parts":[[2023,12,21]],"date-time":"2023-12-21T07:02:28Z","timestamp":1703142148000},"page":"145-159","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Approximation Schemes Under Resource Augmentation for\u00a0Knapsack and\u00a0Packing Problems of\u00a0Hyperspheres and\u00a0Other Shapes"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6506-4174","authenticated-orcid":false,"given":"V\u00edtor Gomes","family":"Chagas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7505-5386","authenticated-orcid":false,"given":"Elisa","family":"Dell\u2019Arriva","sequence":"additional","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"}]}],"member":"297","published-online":{"date-parts":[[2023,12,22]]},"reference":[{"issue":"5","key":"11_CR1","doi-asserted-by":"publisher","first-page":"1513","DOI":"10.1016\/j.cor.2008.02.003","volume":"36","author":"H Akeb","year":"2009","unstructured":"Akeb, H., Hifi, M., M\u2019Hallah, R.: A beam search algorithm for the circular packing problem. Comput. Oper. Res. 36(5), 1513\u20131528 (2009). https:\/\/doi.org\/10.1016\/j.cor.2008.02.003","journal-title":"Comput. Oper. Res."},{"key":"11_CR2","doi-asserted-by":"publisher","unstructured":"Amore, P.: Circle packing in regular polygons. Phys. Fluids (2023). https:\/\/doi.org\/10.1063\/5.0140644","DOI":"10.1063\/5.0140644"},{"issue":"1","key":"11_CR3","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1287\/moor.1050.0168","volume":"31","author":"N Bansal","year":"2006","unstructured":"Bansal, N., Correa, J.R., Kenyon, C., Sviridenko, M.: Bin packing in multiple dimensions: inapproximability results and approximation schemes. Math. Oper. Res. 31(1), 31\u201349 (2006). https:\/\/doi.org\/10.1287\/moor.1050.0168","journal-title":"Math. Oper. Res."},{"key":"11_CR4","doi-asserted-by":"publisher","unstructured":"Bansal, N., Khan, A.: Improved approximation algorithm for two-dimensional bin packing. In: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), SODA 2014, pp. 13\u201325. Society for Industrial and Applied Mathematics (2014). https:\/\/doi.org\/10.1137\/1.9781611973402.2","DOI":"10.1137\/1.9781611973402.2"},{"key":"11_CR5","unstructured":"Berman, F., Leighton, F.T., Snyder, L.: Optimal tile salvage (1981)"},{"issue":"3","key":"11_CR6","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1111\/itor.12006","volume":"20","author":"EG Birgin","year":"2013","unstructured":"Birgin, E.G., Bustamante, L.H., Callisaya, H.F., Mart\u00ednez, J.M.: Packing circles within ellipses. Int. Trans. Oper. Res. 20(3), 365\u2013389 (2013). https:\/\/doi.org\/10.1111\/itor.12006","journal-title":"Int. Trans. Oper. Res."},{"issue":"2","key":"11_CR7","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1016\/j.ejor.2018.07.006","volume":"272","author":"EG Birgin","year":"2019","unstructured":"Birgin, E.G., Lobato, R.D.: A matheuristic approach with nonlinear subproblems for large-scale packing of ellipsoids. Eur. J. Oper. Res. 272(2), 447\u2013464 (2019). https:\/\/doi.org\/10.1016\/j.ejor.2018.07.006","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"11_CR8","doi-asserted-by":"publisher","first-page":"709","DOI":"10.1007\/s10898-015-0395-z","volume":"65","author":"EG Birgin","year":"2015","unstructured":"Birgin, E.G., Lobato, R.D., Mart\u00ednez, J.M.: Packing ellipsoids by nonlinear optimization. J. Glob. Optim. 65(4), 709\u2013743 (2015). https:\/\/doi.org\/10.1007\/s10898-015-0395-z","journal-title":"J. Glob. Optim."},{"issue":"7","key":"11_CR9","doi-asserted-by":"publisher","first-page":"2357","DOI":"10.1016\/j.cor.2006.11.002","volume":"35","author":"EG Birgin","year":"2008","unstructured":"Birgin, E.G., Sobral, F.N.C.: Minimizing the object dimensions in circle and sphere packing problems. Comput. Oper. Res. 35(7), 2357\u20132375 (2008). https:\/\/doi.org\/10.1016\/j.cor.2006.11.002","journal-title":"Comput. Oper. Res."},{"key":"11_CR10","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). https:\/\/doi.org\/10.1016\/j.cosrev.2016.12.001","journal-title":"Comput. Sci. Rev."},{"key":"11_CR11","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1007\/978-1-4419-7997-1_35","volume-title":"Handbook of Combinatorial Optimization","author":"EG Coffman","year":"2013","unstructured":"Coffman, E.G., Csirik, J., Galambos, G., Martello, S., Vigo, D.: Bin packing approximation algorithms: survey and classification. In: Pardalos, P.M., Du, D.-Z., Graham, R.L. (eds.) Handbook of Combinatorial Optimization, pp. 455\u2013531. Springer, New York (2013). https:\/\/doi.org\/10.1007\/978-1-4419-7997-1_35"},{"key":"11_CR12","doi-asserted-by":"publisher","unstructured":"Cohn, H., Kumar, A., Miller, S., Radchenko, D., Viazovska, M.: The sphere packing problem in dimension $$24$$. Ann. Math. 185(3) (2017). https:\/\/doi.org\/10.4007\/annals.2017.185.3.8","DOI":"10.4007\/annals.2017.185.3.8"},{"key":"11_CR13","doi-asserted-by":"publisher","unstructured":"Demaine, E.D., Fekete, S.P., Lang, R.J.: Circle packing for origami design is hard. In: Origami$$^5$$: Proceedings of the 5th International Conference on Origami in Science, Mathematics and Education (OSME 2010), pp. 609\u2013626. A K Peters, Singapore (2010). https:\/\/doi.org\/10.48550\/arXiv.1008.1224","DOI":"10.48550\/arXiv.1008.1224"},{"issue":"3","key":"11_CR14","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/0020-0190(81)90111-3","volume":"12","author":"RJ Fowler","year":"1981","unstructured":"Fowler, R.J., Paterson, M.S., Tanimoto, S.L.: Optimal packing and covering in the plane are NP-complete. Inf. Process. Lett. 12(3), 133\u2013137 (1981). https:\/\/doi.org\/10.1016\/0020-0190(81)90111-3","journal-title":"Inf. Process. Lett."},{"issue":"9","key":"11_CR15","doi-asserted-by":"publisher","first-page":"2505","DOI":"10.1039\/c5sm02875b","volume":"12","author":"L Fu","year":"2016","unstructured":"Fu, L., Steinhardt, W., Zhao, H., Socolar, J.E.S., Charbonneau, P.: Hard sphere packings within cylinders. Soft Matter 12(9), 2505\u20132514 (2016). https:\/\/doi.org\/10.1039\/c5sm02875b","journal-title":"Soft Matter"},{"key":"11_CR16","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s00454-005-1211-1","volume":"36","author":"T Hales","year":"2006","unstructured":"Hales, T., Ferguson, S.: A formulation of the Kepler conjecture. Discret. Comput. Geom. 36, 21\u201369 (2006). https:\/\/doi.org\/10.1007\/s00454-005-1211-1","journal-title":"Discret. Comput. Geom."},{"issue":"44","key":"11_CR17","doi-asserted-by":"publisher","first-page":"4504","DOI":"10.1016\/j.tcs.2009.07.030","volume":"410","author":"R Harren","year":"2009","unstructured":"Harren, R.: Approximation algorithms for orthogonal packing problems for hypercubes. Theor. Comput. Sci. 410(44), 4504\u20134532 (2009). https:\/\/doi.org\/10.1016\/j.tcs.2009.07.030","journal-title":"Theor. Comput. Sci."},{"key":"11_CR18","doi-asserted-by":"publisher","unstructured":"Hifi, M., M\u2019Hallah, R.: A literature review on circle and sphere packing problems: models and methodologies. Adv. Oper. Res. (2009). https:\/\/doi.org\/10.1155\/2009\/150624","DOI":"10.1155\/2009\/150624"},{"issue":"2","key":"11_CR19","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1016\/j.ejor.2018.10.016","volume":"274","author":"M Hifi","year":"2019","unstructured":"Hifi, M., Yousef, L.: A local search-based method for sphere packing problems. Eur. J. Oper. Res. 274(2), 482\u2013500 (2019). https:\/\/doi.org\/10.1016\/j.ejor.2018.10.016","journal-title":"Eur. J. Oper. Res."},{"key":"11_CR20","doi-asserted-by":"publisher","unstructured":"Jansen, K., Khan, A., Lira, M., Sreenivas, K.V.N.: A PTAS for packing hypercubes into a knapsack. In: 49th International Colloquium on Automata, Languages, and Programming, ICALP 2022, Paris, France, 4\u20138 July 2022. LIPIcs, vol. 229, pp. 78:1\u201378:20. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2022). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2022.78","DOI":"10.4230\/LIPIcs.ICALP.2022.78"},{"key":"11_CR21","unstructured":"Kabatyanskii, G.A., Levenshtein, V.I.: Bounds for packings on a sphere and in space (Russian). Problemy Pereda\u010di Informacii 14, 3\u201325 (1978). English translation in Probl. Inf. Transm. 14, 1\u201317 (1978)"},{"issue":"4","key":"11_CR22","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1287\/moor.25.4.645.12118","volume":"25","author":"C Kenyon","year":"2000","unstructured":"Kenyon, C., R\u00e9mila, E.: A near-optimal solution to a two-dimensional cutting stock problem. Math. Oper. Res. 25(4), 645\u2013656 (2000). https:\/\/doi.org\/10.1287\/moor.25.4.645.12118","journal-title":"Math. Oper. Res."},{"key":"11_CR23","unstructured":"Kepler, J.: Strena seu de nive sexangula (the six-cornered snowflake) (1611)"},{"key":"11_CR24","unstructured":"Kim, H., Miltzow, T.: Packing segments in a simple polygon is APX-hard. In: European Conference on Computational Geometry (EuroCG 2015), pp. 24\u201327 (2015)"},{"issue":"3","key":"11_CR25","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/0743-7315(90)90019-L","volume":"10","author":"JYT Leung","year":"1990","unstructured":"Leung, J.Y.T., Tam, T.W., Wong, C.S., Young, G.H., Chin, F.Y.L.: Packing squares into a square. J. Parallel Distrib. Comput. 10(3), 271\u2013275 (1990). https:\/\/doi.org\/10.1016\/0743-7315(90)90019-L","journal-title":"J. Parallel Distrib. Comput."},{"key":"11_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"741","DOI":"10.1007\/978-3-319-77404-6_54","volume-title":"LATIN 2018: Theoretical Informatics","author":"CN Lintzmayer","year":"2018","unstructured":"Lintzmayer, C.N., Miyazawa, F.K., Xavier, E.C.: Two-dimensional Knapsack for circles. In: Bender, M.A., Farach-Colton, M., Mosteiro, M.A. (eds.) LATIN 2018. LNCS, vol. 10807, pp. 741\u2013754. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-77404-6_54"},{"key":"11_CR27","doi-asserted-by":"publisher","unstructured":"Merino, A., Wiese, A.: On the two-dimensional knapsack problem for convex polygons. In: Czumaj, A., Dawar, A., Merelli, E. (eds.) 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020). Leibniz International Proceedings in Informatics (LIPIcs), vol. 168, pp. 84:1\u201384:16. Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2020). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2020.84","DOI":"10.4230\/LIPIcs.ICALP.2020.84"},{"key":"11_CR28","doi-asserted-by":"publisher","first-page":"536","DOI":"10.1007\/978-3-662-44777-2_59","volume":"76","author":"FK Miyazawa","year":"2015","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, 536\u2013568 (2015). https:\/\/doi.org\/10.1007\/978-3-662-44777-2_59","journal-title":"Algorithmica"},{"issue":"1","key":"11_CR29","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1007\/s40863-022-00301-3","volume":"16","author":"FK Miyazawa","year":"2022","unstructured":"Miyazawa, F.K., Wakabayashi, Y.: Techniques and results on approximation algorithms for packing circles. S\u00e3o Paulo J. Math. Sci. 16(1), 585\u2013615 (2022). https:\/\/doi.org\/10.1007\/s40863-022-00301-3","journal-title":"S\u00e3o Paulo J. Math. Sci."},{"issue":"1","key":"11_CR30","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/s10559-023-00544-8","volume":"59","author":"TE Romanova","year":"2023","unstructured":"Romanova, T.E., Stetsyuk, P.I., Fischer, A., Yaskov, G.M.: Proportional packing of circles in a circular container. Cybern. Syst. Anal. 59(1), 82\u201389 (2023). https:\/\/doi.org\/10.1007\/s10559-023-00544-8","journal-title":"Cybern. Syst. Anal."},{"key":"11_CR31","doi-asserted-by":"publisher","unstructured":"Viazovska, M.: The sphere packing problem in dimension $$8$$. Ann. Math. 185(3) (2017). https:\/\/doi.org\/10.4007\/annals.2017.185.3.7","DOI":"10.4007\/annals.2017.185.3.7"},{"issue":"2","key":"11_CR32","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1016\/j.ejor.2015.09.001","volume":"250","author":"Z Zeng","year":"2016","unstructured":"Zeng, Z., Yu, X., He, K., Huang, W., Fu, Z.: Iterated tabu search and variable neighborhood descent for packing unequal circles into a circular container. Eur. J. Oper. Res. 250(2), 615\u2013627 (2016). https:\/\/doi.org\/10.1016\/j.ejor.2015.09.001","journal-title":"Eur. J. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Approximation and Online Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-49815-2_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,21]],"date-time":"2023-12-21T07:03:38Z","timestamp":1703142218000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-49815-2_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031498145","9783031498152"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-49815-2_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"22 December 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WAOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Approximation and Online Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Amsterdam","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"waoa2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/algo-conference.org\/2023\/waoa\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"43","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"16","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"37% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.05","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7.7","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}