{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T16:26:12Z","timestamp":1774369572993,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":14,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,6,21]],"date-time":"2014-06-21T00:00:00Z","timestamp":1403308800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,6,21]]},"DOI":"10.1145\/2612669.2612686","type":"proceedings-article","created":{"date-parts":[[2014,7,1]],"date-time":"2014-07-01T14:23:03Z","timestamp":1404224583000},"page":"12-21","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":13,"title":["On the online fault-tolerant server consolidation problem"],"prefix":"10.1145","author":[{"given":"Khuzaima","family":"Daudjee","sequence":"first","affiliation":[{"name":"University of Waterloo, Waterloo, ON, Canada"}]},{"given":"Shahin","family":"Kamali","sequence":"additional","affiliation":[{"name":"University of Waterloo, Waterloo, ON, Canada"}]},{"given":"Alejandro","family":"L\u00f3pez-Ortiz","sequence":"additional","affiliation":[{"name":"University of Waterloo, Waterloo, ON, Canada"}]}],"member":"320","published-online":{"date-parts":[[2014,6,21]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2012.04.017"},{"key":"e_1_3_2_1_2_1","volume-title":"Approximation algorithms for NP-hard Problems","author":"Coffman E. G.","year":"1997","unstructured":"E. G. Coffman , M. R. Garey , and D. S. Johnson . Approximation algorithms for bin packing: A survey . In D. Hochbaum, editor, Approximation algorithms for NP-hard Problems . PWS Publishing Co. , 1997 . E. G. Coffman, M. R. Garey, and D. S. Johnson. Approximation algorithms for bin packing: A survey. In D. Hochbaum, editor, Approximation algorithms for NP-hard Problems. PWS Publishing Co., 1997."},{"key":"e_1_3_2_1_3_1","first-page":"455","volume-title":"P. M. Pardalos, D.-Z. Du, and R","author":"Coffman E. G.","year":"2013","unstructured":"E. G. Coffman Jr ., J. Csirik , G. Galambos , S. Martello , and D. Vigo . Bin packing approximation algorithms: survey and classification . In P. M. Pardalos, D.-Z. Du, and R . L. Graham, editors, Handbook of Combinatorial Optimization, pages 455 -- 531 . Springer , 2013 . E. G. Coffman Jr., J. Csirik, G. Galambos, S. Martello, and D. Vigo. Bin packing approximation algorithms: survey and classification. In P. M. Pardalos, D.-Z. Du, and R. L. Graham, editors, Handbook of Combinatorial Optimization, pages 455--531. Springer, 2013."},{"key":"e_1_3_2_1_4_1","volume-title":"Build vs. buy: Addressing capital constraints in the data center","year":"2013","unstructured":"CyrusOne executive report. Build vs. buy: Addressing capital constraints in the data center . 2013 . CyrusOne executive report. Build vs. buy: Addressing capital constraints in the data center. 2013."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465308"},{"key":"e_1_3_2_1_6_1","volume-title":"Computers and Intractability: A Guide to the theory of of NP-Completeness","author":"Garey M. R.","year":"1979","unstructured":"M. R. Garey and D. S. Johnson . Computers and Intractability: A Guide to the theory of of NP-Completeness . Freeman and Company , 1979 . M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the theory of of NP-Completeness. Freeman and Company, 1979."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/SCC.2008.39"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/0203025"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3828.3833"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465302"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/585265.585269"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2786.2793"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSC.2010.25"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/HIPC.2010.5713161"}],"event":{"name":"SPAA '14: 26th ACM Symposium on Parallelism in Algorithms and Architectures","location":"Prague Czech Republic","acronym":"SPAA '14","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture"]},"container-title":["Proceedings of the 26th ACM symposium on Parallelism in algorithms and architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2612669.2612686","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2612669.2612686","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:01:34Z","timestamp":1750230094000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2612669.2612686"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6,21]]},"references-count":14,"alternative-id":["10.1145\/2612669.2612686","10.1145\/2612669"],"URL":"https:\/\/doi.org\/10.1145\/2612669.2612686","relation":{},"subject":[],"published":{"date-parts":[[2014,6,21]]},"assertion":[{"value":"2014-06-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}