{"id":"https://openalex.org/W2052361350","doi":"https://doi.org/10.1145/2591796.2591831","title":"Cluster before you hallucinate","display_name":"Cluster before you hallucinate","publication_year":2014,"publication_date":"2014-05-31","ids":{"openalex":"https://openalex.org/W2052361350","doi":"https://doi.org/10.1145/2591796.2591831","mag":"2052361350"},"language":"en","primary_location":{"id":"doi:10.1145/2591796.2591831","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2591796.2591831","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-sixth annual ACM symposium on Theory of computing","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5060555975","display_name":"Ravishankar Krishnaswamy","orcid":"https://orcid.org/0000-0002-5765-0843"},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ravishankar Krishnaswamy","raw_affiliation_strings":["Princeton University","Princeton University#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Princeton University","institution_ids":["https://openalex.org/I20089843"]},{"raw_affiliation_string":"Princeton University#TAB#","institution_ids":["https://openalex.org/I20089843"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5051270969","display_name":"Viswanath Nagarajan","orcid":"https://orcid.org/0000-0002-9514-5581"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Viswanath Nagarajan","raw_affiliation_strings":["IBM T. J. Watson Research Center"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IBM T. J. Watson Research Center","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5046525615","display_name":"Kirk Pruhs","orcid":"https://orcid.org/0000-0001-5680-1753"},"institutions":[{"id":"https://openalex.org/I170201317","display_name":"University of Pittsburgh","ror":"https://ror.org/01an3r305","country_code":"US","type":"education","lineage":["https://openalex.org/I170201317"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kirk Pruhs","raw_affiliation_strings":["University of Pittsburgh"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Pittsburgh","institution_ids":["https://openalex.org/I170201317"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5054641291","display_name":"Clifford Stein","orcid":"https://orcid.org/0000-0002-0614-6620"},"institutions":[{"id":"https://openalex.org/I78577930","display_name":"Columbia University","ror":"https://ror.org/00hj8s172","country_code":"US","type":"education","lineage":["https://openalex.org/I78577930"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Cliff Stein","raw_affiliation_strings":["Columbia University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Columbia University","institution_ids":["https://openalex.org/I78577930"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"734","last_page":"743"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/multicast","display_name":"Multicast","score":0.7266048789024353},{"id":"https://openalex.org/keywords/unicast","display_name":"Unicast","score":0.675884485244751},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.636124849319458},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5009143352508545},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.47775760293006897},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.4375157952308655},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.420646071434021},{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.42050641775131226},{"id":"https://openalex.org/keywords/multi-commodity-flow-problem","display_name":"Multi-commodity flow problem","score":0.419999897480011},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.31823039054870605},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.29583093523979187},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2821289896965027},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.2590634226799011}],"concepts":[{"id":"https://openalex.org/C32295351","wikidata":"https://www.wikidata.org/wiki/Q899288","display_name":"Multicast","level":2,"score":0.7266048789024353},{"id":"https://openalex.org/C11704745","wikidata":"https://www.wikidata.org/wiki/Q918337","display_name":"Unicast","level":3,"score":0.675884485244751},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.636124849319458},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5009143352508545},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.47775760293006897},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.4375157952308655},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.420646071434021},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.42050641775131226},{"id":"https://openalex.org/C170334043","wikidata":"https://www.wikidata.org/wiki/Q6934437","display_name":"Multi-commodity flow problem","level":3,"score":0.419999897480011},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.31823039054870605},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.29583093523979187},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2821289896965027},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.2590634226799011}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2591796.2591831","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2591796.2591831","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-sixth annual ACM symposium on Theory of computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.8999999761581421,"id":"https://metadata.un.org/sdg/7","display_name":"Affordable and clean energy"}],"awards":[{"id":"https://openalex.org/G2685016053","display_name":null,"funder_award_id":"CCF-1115575, CNS-1253218","funder_id":"https://openalex.org/F4320337387","funder_display_name":"Division of Computing and Communication Foundations"},{"id":"https://openalex.org/G7890432555","display_name":null,"funder_award_id":"CCF-0915681, CCF-1349602","funder_id":"https://openalex.org/F4320307762","funder_display_name":"International Business Machines Corporation"},{"id":"https://openalex.org/G8718953421","display_name":null,"funder_award_id":"CCF-1115575, CNS-1253218","funder_id":"https://openalex.org/F4320337388","funder_display_name":"Division of Computer and Network Systems"}],"funders":[{"id":"https://openalex.org/F4320306164","display_name":"Simons Foundation","ror":"https://ror.org/01cmst727"},{"id":"https://openalex.org/F4320307762","display_name":"International Business Machines Corporation","ror":"https://ror.org/05hh8d621"},{"id":"https://openalex.org/F4320337387","display_name":"Division of Computing and Communication Foundations","ror":"https://ror.org/01mng8331"},{"id":"https://openalex.org/F4320337388","display_name":"Division of Computer and Network Systems","ror":"https://ror.org/02rdzmk74"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W63579610","https://openalex.org/W171788235","https://openalex.org/W1540047495","https://openalex.org/W1544574065","https://openalex.org/W1963899113","https://openalex.org/W1967641001","https://openalex.org/W1975508655","https://openalex.org/W1984628625","https://openalex.org/W2019040312","https://openalex.org/W2030365814","https://openalex.org/W2032539720","https://openalex.org/W2034919323","https://openalex.org/W2036836182","https://openalex.org/W2056886715","https://openalex.org/W2096881311","https://openalex.org/W2106676868","https://openalex.org/W2112694890","https://openalex.org/W2117995340","https://openalex.org/W2121085314","https://openalex.org/W2129575457","https://openalex.org/W2133156969","https://openalex.org/W2146957782","https://openalex.org/W2149929647","https://openalex.org/W2150148016","https://openalex.org/W2150516767","https://openalex.org/W2151534739","https://openalex.org/W2156867662","https://openalex.org/W2157247984","https://openalex.org/W2169143327","https://openalex.org/W2172955861","https://openalex.org/W2266190765","https://openalex.org/W2568450825","https://openalex.org/W2953155780","https://openalex.org/W3014052784","https://openalex.org/W3214428327"],"related_works":["https://openalex.org/W3035974271","https://openalex.org/W3141113327","https://openalex.org/W2098682899","https://openalex.org/W4206915070","https://openalex.org/W3161514703","https://openalex.org/W2080904092","https://openalex.org/W2531764854","https://openalex.org/W1994440468","https://openalex.org/W2368069542","https://openalex.org/W4311255633"],"abstract_inverted_index":{"We":[0],"consider":[1],"circuit":[2],"routing":[3,106,153],"with":[4,91,138],"an":[5],"objective":[6],"of":[7,13,63],"minimizing":[8],"energy,":[9],"in":[10,114],"a":[11,38,47,59,83,99,120,131,146],"network":[12,41],"routers":[14],"that":[15,20,29,86,134],"are":[16],"speed":[17],"scalable":[18],"and":[19,53],"may":[21],"be":[22,35],"shutdown":[23],"when":[24],"idle.":[25],"It":[26],"is":[27,56,87,110,135],"known":[28],"this":[30],"energy":[31],"minimization":[32],"problem":[33,80,128],"can":[34],"reduced":[36],"to":[37,57,98,145],"capacitated":[39,78,126],"flow":[40,72],"design":[42,79,127],"problem,":[43,107],"where":[44,108],"vertices":[45,64],"have":[46],"common":[48],"capacity":[49],"but":[50],"arbitrary":[51],"costs,":[52],"the":[54,70,75,103,111,115,123,150],"goal":[55],"choose":[58],"minimum":[60],"cost":[61],"collection":[62],"whose":[65],"induced":[66],"subgraph":[67],"will":[68],"support":[69],"specified":[71],"requirements.":[73],"For":[74,122],"multicast":[76,104],"(single-sink)":[77],"we":[81,129],"give":[82,130],"polynomial-time":[84,132],"algorithm":[85,133],"O(log3":[88],"n)-":[89],"approximate":[90],"O(log4":[92],"n)":[93,140],"congestion.":[94],"This":[95],"translates":[96,143],"back":[97,144],"O(log4\u03b1+3":[100],"n)-approximation":[101,148],"for":[102,149],"energy-minimization":[105,152],"\u03b1":[109],"polynomial":[112],"exponent":[113],"dynamic":[116],"power":[117],"used":[118],"by":[119],"router.":[121],"unicast":[124,151],"(multicommodity)":[125],"O(log5":[136],"n)-approximate":[137],"O(log12":[139],"congestion,":[141],"which":[142],"O(log12\u03b1+5":[147],"problem.":[154]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}