{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:20:48Z","timestamp":1740122448878,"version":"3.37.3"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2020,1,6]],"date-time":"2020-01-06T00:00:00Z","timestamp":1578268800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,6]],"date-time":"2020-01-06T00:00:00Z","timestamp":1578268800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2022,10]]},"DOI":"10.1007\/s10878-019-00515-w","type":"journal-article","created":{"date-parts":[[2020,1,6]],"date-time":"2020-01-06T12:02:43Z","timestamp":1578312163000},"page":"1556-1577","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Robustly assigning unstable items"],"prefix":"10.1007","volume":"44","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9445-1475","authenticated-orcid":false,"given":"Ananya","family":"Christman","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3580-9275","authenticated-orcid":false,"given":"Christine","family":"Chung","sequence":"additional","affiliation":[]},{"given":"Nicholas","family":"Jaczko","sequence":"additional","affiliation":[]},{"given":"Scott","family":"Westvold","sequence":"additional","affiliation":[]},{"given":"David S.","family":"Yuen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,1,6]]},"reference":[{"key":"515_CR1","unstructured":"Chekuri C, Khanna S (2000) A PTAS for the multiple knapsack problem. In: Symposium on discrete algorithms (SODA)"},{"key":"515_CR2","doi-asserted-by":"crossref","unstructured":"Epstein L, Levin A (2006) On bin packing with conflicts. In: Proceedings of the workshop on approximation and online algorithms (WAOA)","DOI":"10.1007\/11970125_13"},{"key":"515_CR3","doi-asserted-by":"crossref","unstructured":"Fleischer L, Goemans MX, Mirrokni VS, Sviridenko M (2006) Tight approximation algorithms for maximum general assignment problems. In: Proceedings of the symposium on discrete algorithms","DOI":"10.1145\/1109557.1109624"},{"key":"515_CR4","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. Freeman, New York"},{"issue":"4","key":"515_CR5","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1023\/A:1009871302966","volume":"3","author":"K Jansen","year":"1999","unstructured":"Jansen K (1999) An approximation scheme for bin packing with conflicts. J Comb Optim 3(4):363\u2013377","journal-title":"J Comb Optim"},{"issue":"2","key":"515_CR6","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1006\/inco.1996.2616","volume":"132","author":"K Jansen","year":"1997","unstructured":"Jansen K, \u00d6hring S (1997) Approximation algorithms for time constrained scheduling. Inf Comput 132(2):85\u2013108","journal-title":"Inf Comput"},{"key":"515_CR7","doi-asserted-by":"crossref","unstructured":"Korupolu M, Rajaraman R (2016) Robust and probabilistic failure-aware placement. In: Proceedings of the symposium on parallelism in algorithms and architectures (SPAA), pp 213\u2013224","DOI":"10.1145\/2935764.2935802"},{"issue":"1\u20132","key":"515_CR8","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1007\/s10107-015-0930-1","volume":"154","author":"M Korupolu","year":"2015","unstructured":"Korupolu M, Meyerson A, Rajaraman R, Tagiku B (2015) Robust and probabilistic failure-aware placement. Math Program 154(1\u20132):493\u2013514","journal-title":"Math Program"},{"key":"515_CR9","unstructured":"Mills K, Chandrasekaran R, Mittal N (2017) Algorithms for optimal replica placement under correlated failure in hierarchical failure domains. In: Theoretical computer science (pre-print)"},{"issue":"1","key":"515_CR10","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/s10723-007-9090-8","volume":"6","author":"R Rahman","year":"2008","unstructured":"Rahman R, Barker K, Alhajj R (2008) Replica placement strategies in data grid. J Grid Comput 6(1):103\u2013123","journal-title":"J Grid Comput"},{"issue":"3","key":"515_CR11","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/BF01585178","volume":"62","author":"D Shmoys","year":"1993","unstructured":"Shmoys D, Tardos E (1993) An approximation algorithm for the generalized assignment problem. Math Program 62(3):461\u2013474","journal-title":"Math Program"},{"issue":"1","key":"515_CR12","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1007\/BF01171114","volume":"27","author":"E Sperner","year":"1928","unstructured":"Sperner E (1928) Ein Satz \u00fcber Untermengen einer endlichen Menge. Math Z 27(1):544\u2013548","journal-title":"Math Z"},{"key":"515_CR13","doi-asserted-by":"crossref","unstructured":"Stein C, Zhong M (2018) Scheduling when you don\u2019t know the number of machines. In: Proceedings of the symposium on discrete algorithms (SODA)","DOI":"10.1137\/1.9781611975031.82"},{"key":"515_CR14","unstructured":"Stirling J (1730) Methodus differentialis, sive tractatus de summation et interpolation serierum infinitarium. London"},{"issue":"5","key":"515_CR15","doi-asserted-by":"publisher","first-page":"1023","DOI":"10.1142\/S012905410700511X","volume":"18","author":"B Urgaonkar","year":"2007","unstructured":"Urgaonkar B, Rosenberg A, Shenoy P (2007) Application placement on a cluster of servers. Int J Found Comput Sci 18(5):1023\u20131041","journal-title":"Int J Found Comput Sci"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-019-00515-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-019-00515-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-019-00515-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,28]],"date-time":"2022-09-28T08:43:25Z","timestamp":1664354605000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-019-00515-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1,6]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,10]]}},"alternative-id":["515"],"URL":"https:\/\/doi.org\/10.1007\/s10878-019-00515-w","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2020,1,6]]},"assertion":[{"value":"6 January 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}