{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T17:19:51Z","timestamp":1743009591955,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031229893"},{"type":"electronic","value":"9783031229909"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-22990-9_5","type":"book-chapter","created":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T01:22:43Z","timestamp":1672536163000},"page":"61-75","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Three-Bar Charts Packing Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2183-523X","authenticated-orcid":false,"given":"Adil","family":"Erzin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Konstantin","family":"Sharankhaev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,1]]},"reference":[{"key":"5_CR1","unstructured":"Complete Proof of Theorem 2: https:\/\/drive.google.com\/drive\/folders\/ 1SLUye20gBVaOWI4YM8z72sgDytJTHs63?usp=sharing"},{"key":"5_CR2","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/0196-6774(85)90018-5","volume":"6","author":"BS Baker","year":"1985","unstructured":"Baker, B.S.: A new proof for the first-fit decreasing bin-packing algorithm. J. Algorithms 6, 49\u201370 (1985)","journal-title":"J. Algorithms"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Bansal, N., Eli\u00e1s, M., Khan, A.: Improved approximation for vector bin packing. In: SODA, pp. 1561\u20131579 (2016)","DOI":"10.1137\/1.9781611974331.ch106"},{"key":"5_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-540-27821-4_6","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"M Bl\u00e4ser","year":"2004","unstructured":"Bl\u00e4ser, M.: A 3\/4-approximation algorithm for maximum ATSP with weights zero and one. In: Jansen, K., Khanna, S., Rolim, J.D.P., Ron, D. (eds.) APPROX\/RANDOM -2004. LNCS, vol. 3122, pp. 61\u201371. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-27821-4_6"},{"issue":"1","key":"5_CR5","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/S0196-6774(03)00112-3","volume":"50","author":"M Blaser","year":"2004","unstructured":"Blaser, M.: An 8\/13-approximation algorithm for the maximum asymmetric TSP. J. Algorithms 50(1), 23\u201348 (2004)","journal-title":"J. Algorithms"},{"key":"5_CR6","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., Khanb, 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":"5_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-74450-4_1","volume-title":"Combinatorics, Algorithms, Probabilistic and Experimental Methodologies","author":"G D\u00f3sa","year":"2007","unstructured":"D\u00f3sa, G.: The tight bound of first fit decreasing bin-packing algorithm is $$FFD(I) \\le 11\/9~OPT(I) + 6\/9$$. In: Chen, B., Paterson, M., Zhang, G. (eds.) ESCAPE 2007. LNCS, vol. 4614, pp. 1\u201311. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74450-4_1"},{"key":"5_CR8","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1007\/978-3-030-58657-7_27","volume-title":"Mathematical Optimization Theory and Operations Research","author":"A Erzin","year":"2020","unstructured":"Erzin, A., Plotnikov, R., Korobkin, A., Melidi, G., Nazarenko, S.: Optimal investment in the development of oil and gas field. In: Kochetov, Y., Bykadorov, I., Gruzdeva, T. (eds.) MOTOR 2020. CCIS, vol. 1275, pp. 336\u2013349. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-58657-7_27"},{"issue":"6","key":"5_CR9","doi-asserted-by":"publisher","first-page":"1955","DOI":"10.1007\/s11590-020-01657-1","volume":"15","author":"A Erzin","year":"2021","unstructured":"Erzin, A., Melidi, G., Nazarenko, S., Plotnikov, R.: Two-bar charts packing problem. Optim. Lett. 15(6), 1955\u20131971 (2021)","journal-title":"Optim. Lett."},{"issue":"1","key":"5_CR10","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/s10878-021-00741-1","volume":"42","author":"A Erzin","year":"2021","unstructured":"Erzin, A., Melidi, G., Nazarenko, S., Plotnikov, R.: A 3\/2-approximation for big two-bar charts packing. J. Comb. Optim. 42(1), 71\u201384 (2021). https:\/\/doi.org\/10.1007\/s10878-021-00741-1","journal-title":"J. Comb. Optim."},{"key":"5_CR11","doi-asserted-by":"publisher","unstructured":"Erzin, A., Shenmaier, V.: An improved approximation for packing big two-bar charts. J. Math. Sci. 267(4), 465\u2013473 (2022). https:\/\/doi.org\/10.1007\/s10958-022-06151-w","DOI":"10.1007\/s10958-022-06151-w"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Gabow, H.: An efficient reduction technique for degree-constrained subgraph and bidirected network flow problems. In: STOC, pp. 448\u2013456 (1983)","DOI":"10.1145\/800061.808776"},{"key":"5_CR13","unstructured":"Garey, M.R., David, S.J.: Computers and Intractability; A Guide to the Theory of NP-Completeness. p. 339 (1979)"},{"key":"5_CR14","unstructured":"Johnson, D.S.: Near-optimal bin packing algorithms. Ph.D thesis, Massachusetts Institute of Technology (1973)"},{"issue":"1","key":"5_CR15","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/0885-064X(85)90022-6","volume":"1","author":"DS Johnson","year":"1985","unstructured":"Johnson, D.S., Garey, M.R.: A 71\/60 theorem for bin packing. J. Complex. 1(1), 65\u2013106 (1985)","journal-title":"J. Complex."},{"key":"5_CR16","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/S0167-6377(02)00173-6","volume":"31","author":"H Kellerer","year":"2003","unstructured":"Kellerer, H., Kotov, V.: An approximation algorithm with absolute worst-case performance ratio 2 for two-dimensional vector packing. Oper. Res. Lett. 31, 35\u201341 (2003)","journal-title":"Oper. Res. Lett."},{"issue":"15","key":"5_CR17","doi-asserted-by":"publisher","first-page":"1262","DOI":"10.1007\/BF02882754","volume":"42","author":"R Li","year":"1997","unstructured":"Li, R., Yue, M.: The proof of $$FFD(L)\\le 11\/9 OPT(L)+7\/9$$. Chin. Sci. Bull. 42(15), 1262\u20131265 (1997)","journal-title":"Chin. Sci. Bull."},{"issue":"2","key":"5_CR18","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/s00224-017-9818-1","volume":"62","author":"K Paluch","year":"2018","unstructured":"Paluch, K.: Maximum ATSP with weights zero and one via half-edges. Theory Comput. Syst. 62(2), 319\u2013336 (2018)","journal-title":"Theory Comput. Syst."},{"key":"5_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04565-7","volume-title":"Approximation Algorithms","author":"VV Vazirani","year":"2003","unstructured":"Vazirani, V.V.: Approximation Algorithms. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-662-04565-7"},{"issue":"4","key":"5_CR20","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/BF02009683","volume":"7","author":"M Yue","year":"1991","unstructured":"Yue, M.: A simple proof of the inequality $$FFD(L)\\le 11\/9 OPT(L)+1, \\forall L$$, for the FFD bin-packing algorithm. Acta Math. Appl. Sin. 7(4), 321\u2013331 (1991)","journal-title":"Acta Math. Appl. Sin."},{"issue":"3","key":"5_CR21","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1007\/BF02011198","volume":"11","author":"M Yue","year":"1995","unstructured":"Yue, M., Zhang, L.: A simple proof of the inequality $$MFFD(L)\\le 71\/60 OPT(L)+1, \\forall L$$, for the MFFD bin-packing algorithm. Acta Math. Appl. Sin. 11(3), 318\u2013330 (1995)","journal-title":"Acta Math. Appl. Sin."}],"container-title":["Communications in Computer and Information Science","Advances in Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-22990-9_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T02:21:30Z","timestamp":1672539690000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22990-9_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031229893","9783031229909"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22990-9_5","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"1 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"OPTIMA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Petrovac","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Montenegro","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 September 2022","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":"optima2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/agora.guru.ru\/display.php?conf=OPTIMA-2022","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-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":"17","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":"40% - 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.1","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":"2.2","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)"}}]}}