{"id":"https://openalex.org/W2020087044","doi":"https://doi.org/10.1145/1060590.1060633","title":"Hardness of the undirected congestion minimization problem","display_name":"Hardness of the undirected congestion minimization problem","publication_year":2005,"publication_date":"2005-05-22","ids":{"openalex":"https://openalex.org/W2020087044","doi":"https://doi.org/10.1145/1060590.1060633","mag":"2020087044"},"language":"en","primary_location":{"id":"doi:10.1145/1060590.1060633","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1060590.1060633","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the thirty-seventh annual ACM symposium on Theory of computing","raw_type":"proceedings-article"},"type":"article","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/A5077188973","display_name":"Matthew Andrews","orcid":"https://orcid.org/0000-0002-0977-9685"},"institutions":[{"id":"https://openalex.org/I72090969","display_name":"Nokia (United States)","ror":"https://ror.org/038km2573","country_code":"US","type":"company","lineage":["https://openalex.org/I2738502077","https://openalex.org/I72090969"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Matthew Andrews","raw_affiliation_strings":["Bell Labs, Murray Hill, NJ","Bell Laboratories Murray Hill NJ"],"affiliations":[{"raw_affiliation_string":"Bell Labs, Murray Hill, NJ","institution_ids":[]},{"raw_affiliation_string":"Bell Laboratories Murray Hill NJ","institution_ids":["https://openalex.org/I72090969"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5060590657","display_name":"Lisa Zhang","orcid":"https://orcid.org/0000-0002-4255-9609"},"institutions":[{"id":"https://openalex.org/I72090969","display_name":"Nokia (United States)","ror":"https://ror.org/038km2573","country_code":"US","type":"company","lineage":["https://openalex.org/I2738502077","https://openalex.org/I72090969"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Lisa Zhang","raw_affiliation_strings":["Bell Labs, Murray Hill, NJ","Bell Laboratories Murray Hill NJ"],"affiliations":[{"raw_affiliation_string":"Bell Labs, Murray Hill, NJ","institution_ids":[]},{"raw_affiliation_string":"Bell Laboratories Murray Hill NJ","institution_ids":["https://openalex.org/I72090969"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5077188973"],"corresponding_institution_ids":["https://openalex.org/I72090969"],"apc_list":null,"apc_paid":null,"fwci":9.1351,"has_fulltext":false,"cited_by_count":41,"citation_normalized_percentile":{"value":0.98424328,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"12","issue":null,"first_page":"284","last_page":"293"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":1.0,"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":1.0,"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.9983999729156494,"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.9966999888420105,"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/minification","display_name":"Minification","score":0.7599535584449768},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.7150057554244995},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5653311014175415},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5282593965530396},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4911510646343231},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4584559500217438},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4210284352302551},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3527052402496338},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3387565314769745},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.29203009605407715}],"concepts":[{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.7599535584449768},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.7150057554244995},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5653311014175415},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5282593965530396},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4911510646343231},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4584559500217438},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4210284352302551},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3527052402496338},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3387565314769745},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.29203009605407715},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1060590.1060633","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1060590.1060633","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the thirty-seventh annual ACM symposium on Theory of computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W1970259241","https://openalex.org/W2022191808","https://openalex.org/W2025470209","https://openalex.org/W2148352980","https://openalex.org/W2169143327","https://openalex.org/W2401610261"],"related_works":["https://openalex.org/W3151522584","https://openalex.org/W4321472505","https://openalex.org/W1497123311","https://openalex.org/W2147954430","https://openalex.org/W2020087044","https://openalex.org/W1994341438","https://openalex.org/W2031552172","https://openalex.org/W2622090745","https://openalex.org/W1637162813","https://openalex.org/W2583782779"],"abstract_inverted_index":{"We":[0],"show":[1],"that":[2],"there":[3],"is":[4,22,30],"no":[5],"(log":[6],"log":[7],"M)1-\u03b5":[8],"approximation":[9],"for":[10],"the":[11,23,26],"undirected":[12],"congestion":[13],"minimization":[14],"problem":[15],"unless":[16],"NP":[17],"\u2286":[18],"ZPTIME(npolylogn),":[19],"where":[20],"M":[21],"size":[24],"of":[25],"graph":[27],"and":[28],"\u03b5":[29],"any":[31],"positive":[32],"constant.":[33]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}