{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T13:35:12Z","timestamp":1742996112636,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319711461"},{"type":"electronic","value":"9783319711478"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","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":[[2017]]},"DOI":"10.1007\/978-3-319-71147-8_9","type":"book-chapter","created":{"date-parts":[[2017,11,15]],"date-time":"2017-11-15T13:33:21Z","timestamp":1510752801000},"page":"122-137","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Lexico-Minimum Replica Placement in Multitrees"],"prefix":"10.1007","author":[{"given":"K. Alex","family":"Mills","sequence":"first","affiliation":[]},{"given":"R.","family":"Chandrasekaran","sequence":"additional","affiliation":[]},{"given":"Neeraj","family":"Mittal","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,11,16]]},"reference":[{"issue":"2","key":"9_CR1","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/s00453-012-9729-0","volume":"69","author":"X Allamigeon","year":"2014","unstructured":"Allamigeon, X.: On the complexity of strongly connected components in directed hypergraphs. Algorithmica 69(2), 335\u2013369 (2014)","journal-title":"Algorithmica"},{"issue":"3","key":"9_CR2","first-page":"429","volume":"21","author":"K Appel","year":"1977","unstructured":"Appel, K., Haken, W.: Every planar map is four colorable. Part I: Discharging illinois J. Math. 21(3), 429\u2013490 (1977)","journal-title":"Part I: Discharging illinois J. Math."},{"issue":"3","key":"9_CR3","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/s00453-007-9044-3","volume":"50","author":"R Cole","year":"2008","unstructured":"Cole, R., Kowalik, L.: New linear-time algorithms for edge-coloring planar graphs. Algorithmica 50(3), 351\u2013368 (2008)","journal-title":"Algorithmica"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Furnas, G.W., Zacks, J.: Multitrees: enriching and reusing hierarchical structure. In: Proceedings SIGCHI Conference on Human Factors in Computing Systems, CHI 1994, pp. 330\u2013336. ACM (1994)","DOI":"10.1145\/191666.191778"},{"key":"9_CR5","unstructured":"Goemans, M.: Lecture notes for \u201cadvanced combinatorial optimization\u201d, Spring 2012. Taught at MIT, Scribed by Zhao, Y."},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Korupolu, M., Rajaraman, R.: Robust and probabilistic failure-aware placements. In: Proceedings of 28th ACM Symposium on Parallelism Algorithms and Architectures, SPAA 2016, pp. 213\u2013224. ACM (2016)","DOI":"10.1145\/2935764.2935802"},{"key":"9_CR7","unstructured":"Mills, K.A., Chandrasekaran, R., Mittal, N.: Algorithms for optimal replica placement under correlated failure in hierarchical failure domains. CoRR abs\/1701.01539 (2017). https:\/\/arxiv.org\/pdf\/1701.01539.pdf"},{"key":"9_CR8","unstructured":"Mills, K.A., Chandrasekaran, R., Mittal, N.: Lexico-minimum replica placement in multitrees. CoRR abs\/1709.05709 (2017). https:\/\/arxiv.org\/abs\/1709.05709"},{"key":"9_CR9","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1007\/978-3-319-26626-8_26","volume-title":"Combinatorial Optimization and Applications","author":"KA Mills","year":"2015","unstructured":"Mills, K.A., Chandrasekaran, R., Mittal, N.: On replica placement in high availability storage under correlated failure. In: Lu, Z., Kim, D., Wu, W., Li, W., Du, D. (eds.) Combinatorial Optimization and Applications. LNCS, vol. 9486, pp. 348\u2013363. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-26626-8_26"},{"key":"9_CR10","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1006\/jctb.2000.2026","volume":"82","author":"B Mohar","year":"2001","unstructured":"Mohar, B.: Face covers and the genus problem for apex graphs. J. Comb. Theor. Ser. B 82, 102\u2013117 (2001)","journal-title":"J. Comb. Theor. Ser. B"},{"issue":"2","key":"9_CR11","doi-asserted-by":"publisher","first-page":"729","DOI":"10.1017\/S0370164600044643","volume":"10","author":"PG Tait","year":"1880","unstructured":"Tait, P.G.: Remarks on the previous communication. Proc. Roy. Soc. Edinburgh 10(2), 729 (1880)","journal-title":"Proc. Roy. Soc. Edinburgh"},{"key":"9_CR12","unstructured":"VMWare Inc.: Administering VMWare Virtual SAN (2015). https:\/\/pubs.vmware.com\/vsphere-60\/topic\/com.vmware.ICbase\/PDF\/virtual-san-60-administration-guide.pdf"}],"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-319-71147-8_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T11:11:31Z","timestamp":1709809891000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-71147-8_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319711461","9783319711478"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-71147-8_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"16 November 2017","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":"Shanghai","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 December 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 December 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoa2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/anl.sjtu.edu.cn\/cocoa2017\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}