{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T07:50:52Z","timestamp":1781077852324,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,6,6]],"date-time":"2011-06-06T00:00:00Z","timestamp":1307318400000},"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":[[2011,6,6]]},"DOI":"10.1145\/1993806.1993854","type":"proceedings-article","created":{"date-parts":[[2011,6,8]],"date-time":"2011-06-08T14:36:21Z","timestamp":1307543781000},"page":"267-276","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":47,"title":["Minimum congestion mapping in a cloud"],"prefix":"10.1145","author":[{"given":"Nikhil","family":"Bansal","sequence":"first","affiliation":[{"name":"IBM T.J. Watson Research Center, Yorktown Heights, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kang-Won","family":"Lee","sequence":"additional","affiliation":[{"name":"IBM T.J. Watson Research Center, Yorktown Heights, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Viswanath","family":"Nagarajan","sequence":"additional","affiliation":[{"name":"IBM T.J. Watson Research Center, Yorktown Heights, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Murtaza","family":"Zafer","sequence":"additional","affiliation":[{"name":"IBM T.J. Watson Research Center, Yorktown Heights, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2011,6,6]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"43","volume-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science","volume":"16","author":"Adams W. P.","year":"1994","unstructured":"W. P. Adams and T. A. Johnson . Improved linear programming-based lower bounds for the quadratic assignment problem . In DIMACS Series in Discrete Mathematics and Theoretical Computer Science , volume 16 , pages 43 -- 77 , 1994 . W. P. Adams and T. A. Johnson. Improved linear programming-based lower bounds for the quadratic assignment problem. In DIMACS Series in Discrete Mathematics and Theoretical Computer Science, volume 16, pages 43--77, 1994."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1502793.1502794"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/258128.258201"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/645929.672712"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536488"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806719"},{"key":"e_1_3_2_1_7_1","volume-title":"Online Computation and Competitive Analysis","author":"Borodin A.","year":"1998","unstructured":"A. Borodin and R. El-Yaniv . Online Computation and Competitive Analysis . Cambridge University Press , 1998 . A. Borodin and R. El-Yaniv. Online Computation and Competitive Analysis. Cambridge University Press, 1998."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2787-6","volume-title":"The Quadratic Assignment Problem: Theory and Algorithms","author":"Cela Eranda","year":"1998","unstructured":"Eranda Cela . The Quadratic Assignment Problem: Theory and Algorithms . Springer , 1998 . Eranda Cela. The Quadratic Assignment Problem: Theory and Algorithms. Springer, 1998."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2007.13"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85363-3_5"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2009.5061987"},{"key":"e_1_3_2_1_12_1","volume-title":"Combinatorial Optimization","author":"Cook W.J.","year":"1998","unstructured":"W.J. Cook , W.H. Cunningham , W.R. Pulleyblank , and A. Schrijver . Combinatorial Optimization . John Wiley and Sons , 1998 . W.J. Cook, W.H. Cunningham, W.R. Pulleyblank, and A. Schrijver. Combinatorial Optimization. John Wiley and Sons, 1998."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1146381.1146388"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/777412.777419"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1644015.1644033"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/331524.331526"},{"key":"e_1_3_2_1_17_1","first-page":"594","volume-title":"ICALP (1)","author":"Makarychev Konstantin","year":"2010","unstructured":"Konstantin Makarychev , Rajsekar Manokaran , and Maxim Sviridenko . Maximum quadratic assignment problem: Reduction from maximum label cover and lp-based approximation algorithm . In ICALP (1) , pages 594 -- 604 , 2010 . Konstantin Makarychev, Rajsekar Manokaran, and Maxim Sviridenko. Maximum quadratic assignment problem: Reduction from maximum label cover and lp-based approximation algorithm. In ICALP (1), pages 594--604, 2010."},{"key":"e_1_3_2_1_18_1","volume-title":"INFOCOM","author":"Meng X.","year":"2010","unstructured":"X. Meng , V. Pappas , and L. Zhang . Impact of Data Center Network Architecture on Virtual Machine Placement . In INFOCOM , 2010 . X. Meng, V. Pappas, and L. Zhang. Impact of Data Center Network Architecture on Virtual Machine Placement. In INFOCOM, 2010."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1090.0418"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/645413.652152"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579324"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1137\/0403036"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1355734.1355737"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2006.322"}],"event":{"name":"PODC '11: ACM Symposium on Principles of Distributed Computing","location":"San Jose California USA","acronym":"PODC '11","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1993806.1993854","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1993806.1993854","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:05:52Z","timestamp":1750244752000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1993806.1993854"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6,6]]},"references-count":24,"alternative-id":["10.1145\/1993806.1993854","10.1145\/1993806"],"URL":"https:\/\/doi.org\/10.1145\/1993806.1993854","relation":{},"subject":[],"published":{"date-parts":[[2011,6,6]]},"assertion":[{"value":"2011-06-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}