{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:37:00Z","timestamp":1742913420332,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030046507"},{"type":"electronic","value":"9783030046514"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","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-030-04651-4_27","type":"book-chapter","created":{"date-parts":[[2018,11,15]],"date-time":"2018-11-15T19:56:50Z","timestamp":1542311810000},"page":"402-420","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Robustly Assigning Unstable Items"],"prefix":"10.1007","author":[{"given":"Ananya","family":"Christman","sequence":"first","affiliation":[]},{"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":[[2018,11,16]]},"reference":[{"key":"27_CR1","unstructured":"Chekuri, C., Khanna, S.: A PTAS for the multiple knapsack problem. In: Symposium on Discrete Algorithms (SODA) (2000)"},{"key":"27_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/11970125_13","volume-title":"Approximation and Online Algorithms","author":"L Epstein","year":"2007","unstructured":"Epstein, L., Levin, A.: On bin packing with conflicts. In: Erlebach, T., Kaklamanis, C. (eds.) WAOA 2006. LNCS, vol. 4368, pp. 160\u2013173. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/11970125_13"},{"key":"27_CR3","doi-asserted-by":"crossref","unstructured":"Fleischer, L., Goemans, M.X., Mirrokni, V.S., Sviridenko, M.: Tight approximation algorithms for maximum general assignment problems. In: Proceedings of the Symposium on Discrete Algorithms (2006)","DOI":"10.1145\/1109557.1109624"},{"key":"27_CR4","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. Freeman, New York (1979)"},{"issue":"4","key":"27_CR5","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1023\/A:1009871302966","volume":"3","author":"K Jansen","year":"1999","unstructured":"Jansen, K.: An approximation scheme for bin packing with conflicts. J. Comb. Optim. 3(4), 363\u2013377 (1999)","journal-title":"J. Comb. Optim."},{"issue":"2","key":"27_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.: Approximation algorithms for time constrained scheduling. Inf. Comput. 132(2), 85\u2013108 (1997)","journal-title":"Inf. Comput."},{"key":"27_CR7","doi-asserted-by":"crossref","unstructured":"Korupolu, M., Rajaraman, R.: Robust and probabilistic failure-aware placement. In: Proceedings of the Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 213\u2013224 (2016)","DOI":"10.1145\/2935764.2935802"},{"issue":"1\u20132","key":"27_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.: Robust and probabilistic failure-aware placement. Math. Program. 154(1\u20132), 493\u2013514 (2015)","journal-title":"Math. Program."},{"key":"27_CR9","unstructured":"Mills, K., Chandrasekaran, R., Mittal, N.: Algorithms for optimal replica placement under correlated failure in hierarchical failure domains. Theor. Comput. Sci. (2017, pre-print)"},{"issue":"1","key":"27_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.: Replica placement strategies in data grid. J. Grid Comput. 6(1), 103\u2013123 (2008)","journal-title":"J. Grid Comput."},{"issue":"3","key":"27_CR11","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/BF01585178","volume":"62","author":"D Shmoys","year":"1993","unstructured":"Shmoys, D., Tardos, E.: An approximation algorithm for the generalized assignment problem. Math. Program. 62(3), 461\u2013474 (1993)","journal-title":"Math. Program."},{"issue":"1","key":"27_CR12","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1007\/BF01171114","volume":"27","author":"E Sperner","year":"1928","unstructured":"Sperner, E.: Ein Satz \u00fcber Untermengen einer endlichen Menge. Mathematische Zeitschrift 27(1), 544\u2013548 (1928)","journal-title":"Mathematische Zeitschrift"},{"key":"27_CR13","doi-asserted-by":"publisher","first-page":"1261","DOI":"10.1137\/1.9781611975031.82","volume-title":"Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Clifford Stein","year":"2018","unstructured":"Stein, C., Zhong, M.: Scheduling when you don\u2019t know the number of machines. In: Proceedings of the Symposium on Discrete Algorithms (SODA) (2018)"},{"key":"27_CR14","unstructured":"Stirling, J.: Methodus differentialis, sive tractatus de summation et interpolation serierum infinitarium, London (1730)"},{"issue":"5","key":"27_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.: Application placement on a cluster of servers. Int. J. Found. Comput. Sci. 18(5), 1023\u20131041 (2007)","journal-title":"Int. J. Found. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-04651-4_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T15:49:53Z","timestamp":1710344993000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-04651-4_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030046507","9783030046514"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-04651-4_27","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":"16 November 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Combinatorial Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Atlanta, GA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","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":"15 December 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoa2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/spacl.kennesaw.edu\/cocoa2018\/cfp.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}