{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:17:09Z","timestamp":1750306629389,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":36,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,5,31]],"date-time":"2014-05-31T00:00:00Z","timestamp":1401494400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000144","name":"Division of Computer and Network Systems","doi-asserted-by":"publisher","award":["CCF-1115575, CNS-1253218"],"award-info":[{"award-number":["CCF-1115575, CNS-1253218"]}],"id":[{"id":"10.13039\/100000144","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000893","name":"Simons Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000893","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100004316","name":"International Business Machines Corporation","doi-asserted-by":"publisher","award":["CCF-0915681, CCF-1349602"],"award-info":[{"award-number":["CCF-0915681, CCF-1349602"]}],"id":[{"id":"10.13039\/100004316","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000143","name":"Division of Computing and Communication Foundations","doi-asserted-by":"publisher","award":["CCF-1115575, CNS-1253218"],"award-info":[{"award-number":["CCF-1115575, CNS-1253218"]}],"id":[{"id":"10.13039\/100000143","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,5,31]]},"DOI":"10.1145\/2591796.2591831","type":"proceedings-article","created":{"date-parts":[[2015,10,1]],"date-time":"2015-10-01T12:01:58Z","timestamp":1443700918000},"page":"734-743","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Cluster before you hallucinate"],"prefix":"10.1145","author":[{"given":"Ravishankar","family":"Krishnaswamy","sequence":"first","affiliation":[{"name":"Princeton University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Viswanath","family":"Nagarajan","sequence":"additional","affiliation":[{"name":"IBM T. J. Watson Research Center"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kirk","family":"Pruhs","sequence":"additional","affiliation":[{"name":"University of Pittsburgh"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cliff","family":"Stein","sequence":"additional","affiliation":[{"name":"Columbia University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2014,5,31]]},"reference":[{"volume-title":"Proc. Vision and RoadmapWorkshop on Routing Telecom and Data Centers Toward Efficient Energy Use.","author":"Vision","unstructured":"Vision and roadmap : Routing telecom and data centers toward efficient energy use, May 2009 . Proc. Vision and RoadmapWorkshop on Routing Telecom and Data Centers Toward Efficient Energy Use. Vision and roadmap: Routing telecom and data centers toward efficient energy use, May 2009. Proc. Vision and RoadmapWorkshop on Routing Telecom and Data Centers Toward Efficient Energy Use.","key":"e_1_3_2_2_1_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_2_1","DOI":"10.1109\/FOCS.2004.32"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_3_1","DOI":"10.1109\/FOCS.2010.61"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_4_1","DOI":"10.5555\/1833515.1833833"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_5_1","DOI":"10.5555\/1333875.1334233"},{"key":"e_1_3_2_2_6_1","volume-title":"SODA","author":"Antoniadis Antonios","year":"2014","unstructured":"Antonios Antoniadis , Sungjin Im , Ravishankar Krishnaswamy , Benjamin Moseley , Viswanath Nagarajan , Kirk Pruhs , and Cliff Stein . Hallucination helps : Energy efficient virtual circuit routing . In SODA , 2014 . Antonios Antoniadis, Sungjin Im, Ravishankar Krishnaswamy, Benjamin Moseley, Viswanath Nagarajan, Kirk Pruhs, and Cliff Stein. Hallucination helps: Energy efficient virtual circuit routing. In SODA, 2014."},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_7_1","DOI":"10.1145\/258128.258201"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_8_1","DOI":"10.5555\/795663.796341"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_9_1","DOI":"10.1007\/978-3-642-39206-1_7"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_10_1","DOI":"10.1007\/978-3-642-34862-4_3"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_11_1","DOI":"10.1145\/1806689.1806719"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_12_1","DOI":"10.1109\/40.888701"},{"key":"e_1_3_2_2_13_1","first-page":"106","volume-title":"SODA","author":"Carr Robert D.","year":"2000","unstructured":"Robert D. Carr , Lisa Fleischer , Vitus J. Leung , and Cynthia A. Phillips . Strengthening integrality gaps for capacitated network design and covering problems . In SODA , pages 106 -- 115 , 2000 . Robert D. Carr, Lisa Fleischer, Vitus J. Leung, and Cynthia A. Phillips. Strengthening integrality gaps for capacitated network design and covering problems. In SODA, pages 106--115, 2000."},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_14_1","DOI":"10.5555\/2018158.2018165"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_15_1","DOI":"10.1007\/978-3-642-40328-6_6"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_16_1","DOI":"10.1145\/1374376.1374403"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_17_1","DOI":"10.1109\/FOCS.2006.15"},{"key":"e_1_3_2_2_18_1","first-page":"1265","volume-title":"SODA","author":"Chekuri Chandra","year":"2007","unstructured":"Chandra Chekuri , M. T. Hajiaghayi , Guy Kortsarz , and M. R. Salavatipour . Approximation algorithms for node-weighted buy-at-bulk network design . In SODA , pages 1265 -- 1274 , 2007 . Chandra Chekuri, M. T. Hajiaghayi, Guy Kortsarz, and M. R. Salavatipour. Approximation algorithms for node-weighted buy-at-bulk network design. In SODA, pages 1265--1274, 2007."},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_19_1","DOI":"10.1109\/FOCS.2009.38"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_20_1","DOI":"10.1007\/s004930050043"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_21_1","DOI":"10.1007\/s004530010050"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_22_1","DOI":"10.1145\/1993636.1993647"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_23_1","DOI":"10.1145\/380752.380827"},{"key":"e_1_3_2_2_24_1","volume-title":"WAOA","author":"Gupta Anupam","year":"2012","unstructured":"Anupam Gupta , Ravishankar Krishnaswamy , and Kirk Pruhs . Online primal-dual for non-linear optimization with applications to speed scaling . In WAOA , 2012 . Anupam Gupta, Ravishankar Krishnaswamy, and Kirk Pruhs. Online primal-dual for non-linear optimization with applications to speed scaling. In WAOA, 2012."},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_25_1","DOI":"10.1145\/1236457.1236458"},{"key":"e_1_3_2_2_26_1","volume-title":"WAOA","author":"Hajiaghayi M.","year":"2013","unstructured":"M. Hajiaghayi , R. Khandekar , G. Kortsarz , and Z. Nutov . Capacitated network design problems: hardness, approximation algorithms, and connections to group steiner tree . In WAOA , 2013 . M. Hajiaghayi, R. Khandekar, G. Kortsarz, and Z. Nutov. Capacitated network design problems: hardness, approximation algorithms, and connections to group steiner tree. In WAOA, 2013."},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_27_1","DOI":"10.5555\/795664.796444"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_28_1","DOI":"10.1287\/moor.24.2.383"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_29_1","DOI":"10.1006\/jagm.1995.1029"},{"key":"e_1_3_2_2_30_1","volume-title":"FOCS","author":"K\u00f6nemann Jochen","year":"2013","unstructured":"Jochen K\u00f6nemann , Sina Sadeghian Sadeghabad, and Laura Sanit\u00e0. An LMP O(log n)-Approximation Algorithm for Node Weighted Prize Collecting Steiner Tree . In FOCS , 2013 . Jochen K\u00f6nemann, Sina Sadeghian Sadeghabad, and Laura Sanit\u00e0. An LMP O(log n)-Approximation Algorithm for Node Weighted Prize Collecting Steiner Tree. In FOCS, 2013."},{"unstructured":"Ravishankar Krishnaswamy Viswanath Nagarajan Kirk Pruhs and Cliff Stein. Cluster before you hallucinate: Approximating node-capacitated network design and energy efficient routing. In ArXiv.  Ravishankar Krishnaswamy Viswanath Nagarajan Kirk Pruhs and Cliff Stein. Cluster before you hallucinate: Approximating node-capacitated network design and energy efficient routing. In ArXiv .","key":"e_1_3_2_2_31_1"},{"key":"e_1_3_2_2_32_1","volume-title":"Computer Networking: A Top-Down Approach","author":"Kurose James F.","year":"2009","unstructured":"James F. Kurose and Keith W. Ross . Computer Networking: A Top-Down Approach . Addison-Wesley Publishing Co. , USA , 2009 . James F. Kurose and Keith W. Ross. Computer Networking: A Top-Down Approach. Addison-Wesley Publishing Co., USA, 2009."},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_33_1","DOI":"10.1145\/331524.331526"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_34_1","DOI":"10.1137\/S0097539702420474"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_35_1","DOI":"10.1137\/08074489X"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_36_1","DOI":"10.1109\/INFCOM.2009.5062123"}],"event":{"sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"acronym":"STOC '14","name":"STOC '14: Symposium on Theory of Computing","location":"New York New York"},"container-title":["Proceedings of the forty-sixth annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2591796.2591831","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2591796.2591831","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:55:45Z","timestamp":1750229745000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2591796.2591831"}},"subtitle":["approximating node-capacitated network design and energy efficient routing"],"short-title":[],"issued":{"date-parts":[[2014,5,31]]},"references-count":36,"alternative-id":["10.1145\/2591796.2591831","10.1145\/2591796"],"URL":"https:\/\/doi.org\/10.1145\/2591796.2591831","relation":{},"subject":[],"published":{"date-parts":[[2014,5,31]]},"assertion":[{"value":"2014-05-31","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}