{"id":"https://openalex.org/W1978807904","doi":"https://doi.org/10.1145/1455248.1455251","title":"Almost-tight hardness of directed congestion minimization","display_name":"Almost-tight hardness of directed congestion minimization","publication_year":2008,"publication_date":"2008-12-01","ids":{"openalex":"https://openalex.org/W1978807904","doi":"https://doi.org/10.1145/1455248.1455251","mag":"1978807904"},"language":"en","primary_location":{"id":"doi:10.1145/1455248.1455251","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1455248.1455251","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-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":[],"countries":[],"is_corresponding":true,"raw_author_name":"Matthew Andrews","raw_affiliation_strings":["Bell Labs, Murray Hill, New Jersey","Bell Laboratories, Murray Hill, New Jersey"],"affiliations":[{"raw_affiliation_string":"Bell Labs, Murray Hill, New Jersey","institution_ids":[]},{"raw_affiliation_string":"Bell Laboratories, Murray Hill, New Jersey","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103087443","display_name":"Lisa Zhang","orcid":"https://orcid.org/0000-0001-6054-2176"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Lisa Zhang","raw_affiliation_strings":["Bell Labs, Murray Hill, New Jersey","Bell Laboratories, Murray Hill, New Jersey"],"affiliations":[{"raw_affiliation_string":"Bell Labs, Murray Hill, New Jersey","institution_ids":[]},{"raw_affiliation_string":"Bell Laboratories, Murray Hill, New Jersey","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5077188973"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.02550327,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.7909028,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"55","issue":"6","first_page":"1","last_page":"20"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9991000294685364,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9977999925613403,"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/rounding","display_name":"Rounding","score":0.8395352363586426},{"id":"https://openalex.org/keywords/randomized-rounding","display_name":"Randomized rounding","score":0.7480231523513794},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6825975179672241},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6819230914115906},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.6092544794082642},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5901438593864441},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5273326635360718},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5038110613822937},{"id":"https://openalex.org/keywords/log-log-plot","display_name":"Log-log plot","score":0.49288320541381836},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.46931812167167664},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4473336935043335},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.43886834383010864},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.22339510917663574},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.17607495188713074}],"concepts":[{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.8395352363586426},{"id":"https://openalex.org/C32029473","wikidata":"https://www.wikidata.org/wiki/Q7292010","display_name":"Randomized rounding","level":3,"score":0.7480231523513794},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6825975179672241},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6819230914115906},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.6092544794082642},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5901438593864441},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5273326635360718},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5038110613822937},{"id":"https://openalex.org/C195292467","wikidata":"https://www.wikidata.org/wiki/Q2091879","display_name":"Log-log plot","level":3,"score":0.49288320541381836},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.46931812167167664},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4473336935043335},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.43886834383010864},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.22339510917663574},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.17607495188713074},{"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},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1455248.1455251","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1455248.1455251","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1550292634","https://openalex.org/W1921591048","https://openalex.org/W1970259241","https://openalex.org/W1989234747","https://openalex.org/W2020087044","https://openalex.org/W2022191808","https://openalex.org/W2025470209","https://openalex.org/W2126492985","https://openalex.org/W2132048723","https://openalex.org/W2148352980","https://openalex.org/W2153625179","https://openalex.org/W2154571828","https://openalex.org/W2169143327","https://openalex.org/W2401610261","https://openalex.org/W4252215110"],"related_works":["https://openalex.org/W1581948717","https://openalex.org/W2268207117","https://openalex.org/W4300488607","https://openalex.org/W2951095575","https://openalex.org/W2105543801","https://openalex.org/W2964080336","https://openalex.org/W2543175834","https://openalex.org/W2963158951","https://openalex.org/W1967762975","https://openalex.org/W2070751425"],"abstract_inverted_index":{"Given":[0],"a":[1,6],"set":[2],"of":[3,22,49],"demands":[4],"in":[5],"directed":[7,10],"graph,":[8],"the":[9,20,24,67],"congestion":[11],"minimization":[12],"problem":[13],"is":[14,40,63],"to":[15,79],"route":[16],"every":[17],"demand":[18],"with":[19],"objective":[21],"minimizing":[23],"heaviest":[25],"load":[26],"over":[27],"all":[28],"edges.":[29],"We":[30],"show":[31],"that":[32],"for":[33],"any":[34],"constant":[35],"\u03b5":[36],">":[37],"0,":[38],"there":[39],"no":[41],"\u03a9(log":[42],"1\u2212\u03b5":[43],"M":[44,51,70,73],")-approximation":[45,74],"algorithm":[46],"on":[47],"networks":[48],"size":[50],"unless":[52],"NP":[53],"\u2286":[54],"ZPTIME":[55],"(":[56],"n":[57,59],"polylog":[58],").":[60],"This":[61],"bound":[62],"almost":[64],"tight":[65],"given":[66],"O":[68],"(log":[69],"/log":[71],"log":[72],"via":[75],"randomized":[76],"rounding":[77],"due":[78],"Raghavan":[80],"and":[81],"Thompson.":[82]},"counts_by_year":[{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}