{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T09:34:28Z","timestamp":1725701668463},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642330896"},{"type":"electronic","value":"9783642330902"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33090-2_38","type":"book-chapter","created":{"date-parts":[[2012,8,28]],"date-time":"2012-08-28T11:29:11Z","timestamp":1346153351000},"page":"431-442","source":"Crossref","is-referenced-by-count":5,"title":["Embedding Paths into Trees: VM Placement to Minimize Congestion"],"prefix":"10.1007","author":[{"given":"Debojyoti","family":"Dutta","sequence":"first","affiliation":[]},{"given":"Michael","family":"Kapralov","sequence":"additional","affiliation":[]},{"given":"Ian","family":"Post","sequence":"additional","affiliation":[]},{"given":"Rajendra","family":"Shinde","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"38_CR1","doi-asserted-by":"crossref","unstructured":"Aspnes, J., Azar, Y., Fiat, A., Plotkin, S., Waarts, O.: Online load balancing with applications to machine scheduling and virtual circuit routing. In: STOC (1993)","DOI":"10.1145\/167088.167248"},{"key":"38_CR2","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Singh, T.: Online algorithms for selective multicast and maximal dense trees. In: STOC (1997)","DOI":"10.1145\/258533.258619"},{"key":"38_CR3","doi-asserted-by":"crossref","unstructured":"Bansal, N., Lee, K.W., Nagarajan, V., Zafer, M.: Minimum congestion mapping in a cloud. In: PODC, pp. 267\u2013276 (2011)","DOI":"10.1145\/1993806.1993854"},{"key":"38_CR4","doi-asserted-by":"crossref","unstructured":"Chowdhury, N.M.M.K., Rahman, M.R., Boutaba, R.: Virtual network embedding with coordinated node and link mapping. In: INFOCOM (2009)","DOI":"10.1109\/INFCOM.2009.5061987"},{"key":"38_CR5","unstructured":"Garg, N., Konjevod, G., Ravi, R.: A polylogarithmic approximation algorithm for the group steiner tree problem. In: SODA (1998"},{"key":"38_CR6","unstructured":"Goel, A., Hezinger, M., Plotkin, S.: Online throughput-comptetitive algorithm for multicast routing and admission control. In: SODA (1998)"},{"key":"38_CR7","doi-asserted-by":"crossref","unstructured":"Hassin, R., Levin, A., Sviridenko, M.: Approximating the minimum quadratic assignment problems. ACM Transactions on Algorithms (2009)","DOI":"10.1145\/1644015.1644033"},{"issue":"3","key":"38_CR8","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1002\/rsa.10038","volume":"20","author":"G. Konjevod","year":"2002","unstructured":"Konjevod, G., Ravi, R., Srinivasan, A.: Approximation algorithms for the covering steiner problem. Random Structures & Algorithms\u00a020(3), 465\u2013482 (2002)","journal-title":"Random Structures & Algorithms"},{"key":"38_CR9","doi-asserted-by":"crossref","unstructured":"Meng, X., Pappas, V., Zhang, L.: Improving the scalability of data center networks with traffic-aware virtual machine placement. In: INFOCOM (2010)","DOI":"10.1109\/INFCOM.2010.5461930"},{"key":"38_CR10","unstructured":"Racke, H.: Minimizing congestion in general networks. In: FOCS (2002)"},{"key":"38_CR11","unstructured":"Rastogi, R., Silberschatz, A., Yener, B.: Secondnet: a data center network virtualization architecture with bandwidth guarantees. In: Co-NEXT Workshop (2010)"},{"key":"38_CR12","doi-asserted-by":"crossref","unstructured":"Yu, M., Yi, Y., Rexford, J., Chiang, M.: Rethinking virtual network embedding: Substrate support for path splitting and migration. In: SIGCOMM (2008)","DOI":"10.1145\/1355734.1355737"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2012"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33090-2_38.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T07:54:55Z","timestamp":1620114895000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33090-2_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642330896","9783642330902"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33090-2_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}