{"id":"https://openalex.org/W2125725829","doi":"https://doi.org/10.1145/1132516.1132592","title":"Logarithmic hardness of the directed congestion minimization problem","display_name":"Logarithmic hardness of the directed congestion minimization problem","publication_year":2006,"publication_date":"2006-05-21","ids":{"openalex":"https://openalex.org/W2125725829","doi":"https://doi.org/10.1145/1132516.1132592","mag":"2125725829"},"language":"en","primary_location":{"id":"doi:10.1145/1132516.1132592","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1132516.1132592","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-eighth 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":3.5973,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.93101686,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"517","last_page":"526"},"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9980999827384949,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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.9965000152587891,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/randomized-rounding","display_name":"Randomized rounding","score":0.8697569370269775},{"id":"https://openalex.org/keywords/rounding","display_name":"Rounding","score":0.863120436668396},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.7178235054016113},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6628209352493286},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.6278687715530396},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.6024074554443359},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5612702369689941},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.550165593624115},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5484925508499146},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5363840460777283},{"id":"https://openalex.org/keywords/log-log-plot","display_name":"Log-log plot","score":0.4494646191596985},{"id":"https://openalex.org/keywords/discrete-logarithm","display_name":"Discrete logarithm","score":0.4445296823978424},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.43510088324546814},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.423445463180542},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.25107163190841675},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.19386804103851318},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.06150063872337341},{"id":"https://openalex.org/keywords/public-key-cryptography","display_name":"Public-key cryptography","score":0.06135651469230652}],"concepts":[{"id":"https://openalex.org/C32029473","wikidata":"https://www.wikidata.org/wiki/Q7292010","display_name":"Randomized rounding","level":3,"score":0.8697569370269775},{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.863120436668396},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.7178235054016113},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6628209352493286},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.6278687715530396},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.6024074554443359},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5612702369689941},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.550165593624115},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5484925508499146},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5363840460777283},{"id":"https://openalex.org/C195292467","wikidata":"https://www.wikidata.org/wiki/Q2091879","display_name":"Log-log plot","level":3,"score":0.4494646191596985},{"id":"https://openalex.org/C173259116","wikidata":"https://www.wikidata.org/wiki/Q864003","display_name":"Discrete logarithm","level":4,"score":0.4445296823978424},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.43510088324546814},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.423445463180542},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.25107163190841675},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.19386804103851318},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.06150063872337341},{"id":"https://openalex.org/C203062551","wikidata":"https://www.wikidata.org/wiki/Q201339","display_name":"Public-key cryptography","level":3,"score":0.06135651469230652},{"id":"https://openalex.org/C148730421","wikidata":"https://www.wikidata.org/wiki/Q141090","display_name":"Encryption","level":2,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"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/1132516.1132592","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1132516.1132592","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-eighth annual ACM symposium on Theory of Computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1550292634","https://openalex.org/W1921591048","https://openalex.org/W1970259241","https://openalex.org/W1975442866","https://openalex.org/W2020087044","https://openalex.org/W2022191808","https://openalex.org/W2025470209","https://openalex.org/W2079300367","https://openalex.org/W2148352980","https://openalex.org/W2154571828","https://openalex.org/W2401610261"],"related_works":["https://openalex.org/W1581948717","https://openalex.org/W1941111399","https://openalex.org/W2268207117","https://openalex.org/W4313357160","https://openalex.org/W4300488607","https://openalex.org/W2951095575","https://openalex.org/W2105543801","https://openalex.org/W2561769964","https://openalex.org/W1916943706","https://openalex.org/W2002272911"],"abstract_inverted_index":{"We":[0],"show":[1],"that":[2],"for":[3,14],"any":[4],"constant":[5],"\u03b5":[6],">":[7],"0,":[8],"there":[9],"is":[10,32],"no":[11],"\u03a9(log1-\u03b5M)-approximation":[12],"algorithm":[13],"the":[15,36],"directed":[16],"congestion":[17],"minimization":[18],"problem":[19],"on":[20],"networks":[21],"of":[22],"size":[23],"M":[24],"unless":[25],"NP":[26],"\u2286":[27],"ZPTIME(npolylog":[28],"n).":[29],"This":[30],"bound":[31],"almost":[33],"tight":[34],"given":[35],"O(log":[37],"M/":[38],"log":[39,40],"M)-approximation":[41],"via":[42],"randomized":[43],"rounding":[44],"due":[45],"to":[46],"Raghavan":[47],"and":[48],"Thompson.":[49]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
