{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,1]],"date-time":"2024-04-01T11:48:40Z","timestamp":1711972120754},"reference-count":27,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"4","funder":[{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-16-CE40-0018"],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Discrete Math."],"published-print":{"date-parts":[[2022,12]]},"DOI":"10.1137\/21m1457199","type":"journal-article","created":{"date-parts":[[2022,10,24]],"date-time":"2022-10-24T15:32:00Z","timestamp":1666625520000},"page":"2534-2552","source":"Crossref","is-referenced-by-count":1,"title":["Constant-Ratio Approximation for Robust Bin Packing with Budgeted Uncertainty"],"prefix":"10.1137","volume":"36","author":[{"given":"Marin","family":"Bougeret","sequence":"first","affiliation":[]},{"given":"Gy\u00f6rgy","family":"D\u00f3sa","sequence":"additional","affiliation":[]},{"given":"Noam","family":"Goldberg","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-9145-2525","authenticated-orcid":true,"given":"Michael","family":"Poss","sequence":"additional","affiliation":[]}],"member":"351","published-online":{"date-parts":[[2022,10,24]]},"reference":[{"key":"atypb1","doi-asserted-by":"publisher","DOI":"10.1002\/jos.74"},{"key":"atypb2","doi-asserted-by":"crossref","unstructured":"E. \u00c1lvarez-Miranda, I. Ljubic, and P. Toth,A note on the Bertsimas & Sim algorithm for robust combinatorial optimization problems, 4OR, 11 (2013), pp. 349-360,https:\/\/doi.org\/10.1007\/s10288-013-0231-6.","DOI":"10.1007\/s10288-013-0231-6"},{"key":"atypb3","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(84)90004-X"},{"key":"atypb4","volume-title":"26th European Symposium on Algorithms, Y. Azar, H. Bast, and G. Herman, eds., LIPIcs, Liebniz Int. Proc. Inform. 112","author":"Balogh J.","year":"2018"},{"key":"atypb5","first-page":"18","volume-title":"International Workshop on Approximation and Online Algorithms","author":"Balogh J.","year":"2019"},{"key":"atypb6","first-page":"1425","volume-title":"Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, ACM","author":"Balogh J.","year":"2015"},{"key":"atypb7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-24766-9_6"},{"key":"atypb8","doi-asserted-by":"publisher","DOI":"10.1515\/9781400831050"},{"key":"atypb9","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-003-0396-4"},{"key":"atypb10","first-page":"60","volume-title":"International Workshop on Approximation and Online Algorithms","author":"Bougeret M.","year":"2019"},{"key":"atypb11","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2018.07.001"},{"key":"atypb12","doi-asserted-by":"publisher","DOI":"10.1007\/s13675-018-0103-0"},{"key":"atypb13","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2016.12.001"},{"key":"atypb14","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579456"},{"key":"atypb15","doi-asserted-by":"publisher","DOI":"10.1097\/00000542-199911000-00043"},{"key":"atypb16","volume-title":"First International Symposium, ESCAPE 2007","author":"D\u00f3sa G.","year":"2007"},{"key":"atypb17","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey M. R.","year":"1979"},{"key":"atypb18","first-page":"89","volume-title":"International Workshop on Approximation and Online Algorithms, (WAOA 2011","author":"Goetzmann K.","year":"2011"},{"key":"atypb19","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2019.05.029"},{"key":"atypb20","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1120.1136"},{"key":"atypb21","doi-asserted-by":"publisher","DOI":"10.1137\/0203025"},{"key":"atypb22","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1982.61"},{"key":"atypb23","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2020.2035"},{"key":"atypb24","doi-asserted-by":"publisher","DOI":"10.1016\/j.disopt.2017.09.004"},{"key":"atypb25","doi-asserted-by":"publisher","DOI":"10.1002\/1520-6750(199406)41:4<579::AID-NAV3220410409>3.0.CO;2-G"},{"key":"atypb26","doi-asserted-by":"publisher","DOI":"10.1080\/24725854.2018.1468122"},{"key":"atypb27","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-015-0418-0"}],"container-title":["SIAM Journal on Discrete Mathematics"],"original-title":[],"language":"en","deposited":{"date-parts":[[2022,12,22]],"date-time":"2022-12-22T16:11:01Z","timestamp":1671725461000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/21M1457199"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,24]]},"references-count":27,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["10.1137\/21M1457199"],"URL":"https:\/\/doi.org\/10.1137\/21m1457199","relation":{},"ISSN":["0895-4801","1095-7146"],"issn-type":[{"value":"0895-4801","type":"print"},{"value":"1095-7146","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,10,24]]}}}