{"id":"https://openalex.org/W2166747457","doi":"https://doi.org/10.1145/1361192.1361200","title":"On the approximability of some network design problems","display_name":"On the approximability of some network design problems","publication_year":2008,"publication_date":"2008-05-01","ids":{"openalex":"https://openalex.org/W2166747457","doi":"https://doi.org/10.1145/1361192.1361200","mag":"2166747457"},"language":"en","primary_location":{"id":"doi:10.1145/1361192.1361200","is_oa":true,"landing_page_url":"https://doi.org/10.1145/1361192.1361200","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/1361192.1361200","source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"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":"ACM Transactions on Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1145/1361192.1361200","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5056023203","display_name":"Julia Chuzhoy","orcid":"https://orcid.org/0000-0001-7839-751X"},"institutions":[{"id":"https://openalex.org/I79576946","display_name":"University of Pennsylvania","ror":"https://ror.org/00b30xv10","country_code":"US","type":"education","lineage":["https://openalex.org/I79576946"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Julia Chuzhoy","raw_affiliation_strings":["Computer Science and Artificial Intelligence Laboratory, MIT and, University of Pennsylvania"],"affiliations":[{"raw_affiliation_string":"Computer Science and Artificial Intelligence Laboratory, MIT and, University of Pennsylvania","institution_ids":["https://openalex.org/I79576946"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5078381067","display_name":"Anupam Gupta","orcid":"https://orcid.org/0000-0001-5579-3405"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Anupam Gupta","raw_affiliation_strings":["Carnegie Mellon University, Pittsburgh, PA"],"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, PA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5025400832","display_name":"Joseph Naor","orcid":null},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Joseph (Seffi) Naor","raw_affiliation_strings":["Technion, Israel, Haifa, Israel"],"affiliations":[{"raw_affiliation_string":"Technion, Israel, Haifa, Israel","institution_ids":["https://openalex.org/I174306211"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5024448261","display_name":"Amitabh Sinha","orcid":"https://orcid.org/0000-0002-6035-3671"},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan\u2013Ann Arbor","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Amitabh Sinha","raw_affiliation_strings":["University of Michigan, Ann Arbor, MI"],"affiliations":[{"raw_affiliation_string":"University of Michigan, Ann Arbor, MI","institution_ids":["https://openalex.org/I27837315"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5056023203"],"corresponding_institution_ids":["https://openalex.org/I79576946"],"apc_list":null,"apc_paid":null,"fwci":4.1158,"has_fulltext":true,"cited_by_count":45,"citation_normalized_percentile":{"value":0.93973832,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"4","issue":"2","first_page":"1","last_page":"17"},"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.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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","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/T10374","display_name":"Advanced Graph Theory Research","score":0.9991999864578247,"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/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9961000084877014,"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/steiner-tree-problem","display_name":"Steiner tree problem","score":0.73201584815979},{"id":"https://openalex.org/keywords/network-planning-and-design","display_name":"Network planning and design","score":0.5891243815422058},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5197553038597107},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5016417503356934},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5007114410400391},{"id":"https://openalex.org/keywords/bandwidth","display_name":"Bandwidth (computing)","score":0.4971487820148468},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4577648937702179},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.41151684522628784},{"id":"https://openalex.org/keywords/minimum-cost-flow-problem","display_name":"Minimum-cost flow problem","score":0.41123926639556885},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4022435247898102},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3440297245979309},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.295798122882843},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.2325197458267212}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.73201584815979},{"id":"https://openalex.org/C114563136","wikidata":"https://www.wikidata.org/wiki/Q19725982","display_name":"Network planning and design","level":2,"score":0.5891243815422058},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5197553038597107},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5016417503356934},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5007114410400391},{"id":"https://openalex.org/C2776257435","wikidata":"https://www.wikidata.org/wiki/Q1576430","display_name":"Bandwidth (computing)","level":2,"score":0.4971487820148468},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4577648937702179},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.41151684522628784},{"id":"https://openalex.org/C99545648","wikidata":"https://www.wikidata.org/wiki/Q2897180","display_name":"Minimum-cost flow problem","level":3,"score":0.41123926639556885},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4022435247898102},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3440297245979309},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.295798122882843},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.2325197458267212}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/1361192.1361200","is_oa":true,"landing_page_url":"https://doi.org/10.1145/1361192.1361200","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/1361192.1361200","source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"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":"ACM Transactions on Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.212.4205","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.212.4205","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.cmu.edu/~anupamg/adv-approx/priority.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.385.4729","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.385.4729","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://ttic.uchicago.edu/~cjulia/papers/network-design-journal.pdf","raw_type":"text"}],"best_oa_location":{"id":"doi:10.1145/1361192.1361200","is_oa":true,"landing_page_url":"https://doi.org/10.1145/1361192.1361200","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/1361192.1361200","source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"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":"ACM Transactions on Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.4099999964237213,"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure"}],"awards":[{"id":"https://openalex.org/G1110645641","display_name":"Graph-theoretic Approximation Algorithms","funder_award_id":"0105548","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G1171700966","display_name":null,"funder_award_id":"NSF CAREER","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G1665908117","display_name":null,"funder_award_id":"CCF-448095","funder_id":"https://openalex.org/F4320337387","funder_display_name":"Division of Computing and Communication Foundations"},{"id":"https://openalex.org/G3611245443","display_name":null,"funder_award_id":"2002-276","funder_id":"https://openalex.org/F4320320950","funder_display_name":"United States-Israel Binational Science Foundation"},{"id":"https://openalex.org/G6484169224","display_name":"ITR/SY+IM+AP: Center for Applied Algorithms","funder_award_id":"0122581","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6546929923","display_name":null,"funder_award_id":"CCR-0122581","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6671297155","display_name":null,"funder_award_id":"CAREER","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8459718620","display_name":null,"funder_award_id":"CCR-0105548","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G848032724","display_name":null,"funder_award_id":"Science","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G916464097","display_name":null,"funder_award_id":"IST-1999-14084","funder_id":"https://openalex.org/F4320334962","funder_display_name":"Sixth Framework Programme"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320310207","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33"},{"id":"https://openalex.org/F4320320950","display_name":"United States-Israel Binational Science Foundation","ror":"https://ror.org/00j8z2m73"},{"id":"https://openalex.org/F4320334962","display_name":"Sixth Framework Programme","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320337387","display_name":"Division of Computing and Communication Foundations","ror":"https://ror.org/01mng8331"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2166747457.pdf","grobid_xml":"https://content.openalex.org/works/W2166747457.grobid-xml"},"referenced_works_count":46,"referenced_works":["https://openalex.org/W1532411173","https://openalex.org/W1544515183","https://openalex.org/W1577487475","https://openalex.org/W1597798419","https://openalex.org/W1755312702","https://openalex.org/W1759768216","https://openalex.org/W1968143987","https://openalex.org/W1970259241","https://openalex.org/W1975789655","https://openalex.org/W1983969450","https://openalex.org/W1984628625","https://openalex.org/W2010140631","https://openalex.org/W2010440802","https://openalex.org/W2018511415","https://openalex.org/W2022712087","https://openalex.org/W2029608151","https://openalex.org/W2034112563","https://openalex.org/W2034457158","https://openalex.org/W2059453880","https://openalex.org/W2059707428","https://openalex.org/W2062268671","https://openalex.org/W2079936083","https://openalex.org/W2082353536","https://openalex.org/W2089897116","https://openalex.org/W2097181193","https://openalex.org/W2101622070","https://openalex.org/W2104701012","https://openalex.org/W2106676868","https://openalex.org/W2113857227","https://openalex.org/W2124295613","https://openalex.org/W2133156969","https://openalex.org/W2142758253","https://openalex.org/W2142779979","https://openalex.org/W2148352980","https://openalex.org/W2148965337","https://openalex.org/W2163150343","https://openalex.org/W2169143327","https://openalex.org/W2169396071","https://openalex.org/W2172955861","https://openalex.org/W2176308295","https://openalex.org/W2295961103","https://openalex.org/W4214936872","https://openalex.org/W4243637616","https://openalex.org/W4245266864","https://openalex.org/W4285719527","https://openalex.org/W6657815794"],"related_works":["https://openalex.org/W2407277019","https://openalex.org/W2125311247","https://openalex.org/W3035891971","https://openalex.org/W2120679858","https://openalex.org/W1992520347","https://openalex.org/W2786089943","https://openalex.org/W2018511415","https://openalex.org/W2623734410","https://openalex.org/W1537426782","https://openalex.org/W2166747457"],"abstract_inverted_index":{"Consider":[0],"the":[1,55,96,119,209,214,220,240,243,253],"following":[2],"classical":[3],"network":[4,113,166,248],"design":[5,114,167,249],"problem:":[6],"a":[7,22,91,104,131,236],"set":[8],"of":[9,45,73,93,98,111,133,223,242,245,247],"terminals":[10],"T":[11],"=":[12,31,195],"{":[13],"t":[14,39],"i":[15,40,43],"}":[16],"wishes":[17],"to":[18,21,51,57,135,146],"send":[19],"traffic":[20,46],"root":[23],"r":[24],"in":[25,70,158,163,239],"an":[26,63,224],"n":[27,176,183,188,196],"-node":[28],"graph":[29],"G":[30],"(":[32,182],"V":[33,193],",":[34],"E":[35],").":[36],"Each":[37],"terminal":[38],"sends":[41],"d":[42],"units":[44],"and":[47,79,218],"enough":[48],"bandwidth":[49,61,86,120],"has":[50],"be":[52,68,136,147,170],"allocated":[53,69],"on":[54,62,87,138],"edges":[56,127],"permit":[58],"this.":[59],"However,":[60],"edge":[64,88],"e":[65,78,85,89],"can":[66,128],"only":[67,129],"integral":[71],"multiples":[72],"some":[74],"base":[75],"capacity":[76],"u":[77,84],"hence":[80],"provisioning":[81],"k":[82],"\u00d7":[83],"incurs":[90],"cost":[92,97],"\u2308k\u2309":[94],"times":[95],"that":[99,154,202],"edge.":[100],"The":[101],"objective":[102],"is":[103,109,122],"minimum-cost":[105],"feasible":[106],"solution.":[107],"This":[108],"one":[110],"many":[112],"problems":[115,162],"widely":[116],"studied":[117],"where":[118,191],"allocation":[121],"governed":[123],"by":[124],"side":[125],"constraints:":[126],"allow":[130],"subset":[132],"cables":[134],"purchased":[137],"them":[139],"or":[140],"certain":[141],"quality-of-service":[142],"requirements":[143],"may":[144],"have":[145],"met.":[148],"In":[149,198],"this":[150,155,164,203],"work,":[151],"we":[152,200],"show":[153,201],"problem":[156],"and,":[157],"fact,":[159],"several":[160],"basic":[161],"general":[165],"framework":[168],"cannot":[169],"approximated":[171],"better":[172],"than":[173],"\u03a9(log":[174],"log":[175,186,187],")":[177,189],"unless":[178],"NP":[179],"\u2286":[180],"DTIME":[181],"O":[184],"(log":[185],"),":[190],"|":[192,194],".":[197],"particular,":[199],"inapproximability":[204],"threshold":[205],"holds":[206],"for":[207,259],"(i)":[208],"Priority-Steiner":[210],"Tree":[211],"problem,":[212,217,228],"(ii)":[213],"(single-sink)":[215],"Cost-Distance":[216],"(iii)":[219],"single-sink":[221],"version":[222],"even":[225],"more":[226],"fundamental":[227],"Fixed":[229],"Charge":[230],"Network":[231],"Flow.":[232],"Our":[233],"results":[234,257],"provide":[235],"further":[237],"breakthrough":[238],"understanding":[241],"level":[244],"complexity":[246],"problems.":[250,262],"These":[251],"are":[252],"first":[254],"nonconstant":[255],"hardness":[256],"known":[258],"all":[260],"these":[261]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":6},{"year":2019,"cited_by_count":8},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}