{"id":"https://openalex.org/W2227904476","doi":"https://doi.org/10.1137/110825959","title":"Minimum-Cost Network Design with (Dis)economies of Scale","display_name":"Minimum-Cost Network Design with (Dis)economies of Scale","publication_year":2016,"publication_date":"2016-01-01","ids":{"openalex":"https://openalex.org/W2227904476","doi":"https://doi.org/10.1137/110825959","mag":"2227904476"},"language":"en","primary_location":{"id":"doi:10.1137/110825959","is_oa":false,"landing_page_url":"https://doi.org/10.1137/110825959","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5079501848","display_name":"Spyridon Antonakopoulos","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Spyridon Antonakopoulos","raw_affiliation_strings":[],"affiliations":[]},{"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":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5077188973"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3485,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.63458577,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"45","issue":"1","first_page":"49","last_page":"66"},"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.996999979019165,"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.9939000010490417,"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/subadditivity","display_name":"Subadditivity","score":0.7232754826545715},{"id":"https://openalex.org/keywords/randomized-rounding","display_name":"Randomized rounding","score":0.6146020889282227},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.5998942255973816},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5747717022895813},{"id":"https://openalex.org/keywords/superadditivity","display_name":"Superadditivity","score":0.566692590713501},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5543875098228455},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.531936526298523},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.47482404112815857},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.47474008798599243},{"id":"https://openalex.org/keywords/embedding","display_name":"Embedding","score":0.4509321451187134},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.4394633173942566},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.34814244508743286},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3317405879497528},{"id":"https://openalex.org/keywords/mathematical-economics","display_name":"Mathematical economics","score":0.12911036610603333}],"concepts":[{"id":"https://openalex.org/C19220575","wikidata":"https://www.wikidata.org/wiki/Q1934099","display_name":"Subadditivity","level":2,"score":0.7232754826545715},{"id":"https://openalex.org/C32029473","wikidata":"https://www.wikidata.org/wiki/Q7292010","display_name":"Randomized rounding","level":3,"score":0.6146020889282227},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.5998942255973816},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5747717022895813},{"id":"https://openalex.org/C20017120","wikidata":"https://www.wikidata.org/wiki/Q922087","display_name":"Superadditivity","level":2,"score":0.566692590713501},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5543875098228455},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.531936526298523},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.47482404112815857},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.47474008798599243},{"id":"https://openalex.org/C41608201","wikidata":"https://www.wikidata.org/wiki/Q980509","display_name":"Embedding","level":2,"score":0.4509321451187134},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.4394633173942566},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.34814244508743286},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3317405879497528},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.12911036610603333},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/110825959","is_oa":false,"landing_page_url":"https://doi.org/10.1137/110825959","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1984361668","https://openalex.org/W2001139415","https://openalex.org/W2005012890","https://openalex.org/W2011823863","https://openalex.org/W2019041817","https://openalex.org/W2020400310","https://openalex.org/W2034919323","https://openalex.org/W2075234266","https://openalex.org/W2096881311","https://openalex.org/W2098008076","https://openalex.org/W2117768313","https://openalex.org/W2336037696","https://openalex.org/W3030774092"],"related_works":["https://openalex.org/W1545891988","https://openalex.org/W4302085088","https://openalex.org/W2950082292","https://openalex.org/W2560457344","https://openalex.org/W1180893010","https://openalex.org/W3124089944","https://openalex.org/W2529372321","https://openalex.org/W3006632508","https://openalex.org/W2503243575","https://openalex.org/W4376646767"],"abstract_inverted_index":{"Given":[0],"a":[1,3,8,96,117,162,173,177,263,272],"network,":[2],"set":[4],"of":[5,25,44,91,119,209,219],"demands,":[6],"and":[7,76,80,121,147,206,227,234,243],"cost":[9,42,99,105],"function":[10,106],"$f(\\cdot)$,":[11],"the":[12,23,32,37,45,70,88,104,199,217,266,275],"min-cost":[13,180],"network":[14,73],"design":[15,74],"problem":[16,75,182,196],"is":[17,31,64,108,161,186],"to":[18,69,115,151,203,224,241,261],"route":[19],"all":[20],"demands":[21],"with":[22,55,95],"objective":[24],"minimizing":[26],"$\\sum_e":[27],"f(\\ell_e)$,":[28],"where":[29],"$\\ell_e$":[30],"total":[33,267],"traffic":[34],"load":[35],"under":[36],"routing.":[38],"We":[39,135,154,166],"focus":[40,86],"on":[41,87,265],"functions":[43],"form":[46],"$f(x)=":[47],"\\sigma":[48],"+":[49],"x^{\\alpha}$":[50],"for":[51,124,176,194],"$x":[52],">":[53,93,101],"0$,":[54],"$f(0)":[56],"=":[57],"0$.":[58,102],"For":[59],"$\\alpha":[60,92],"\\le":[61],"1$,":[62],"$f(\\cdot)$":[63,107],"subadditive.":[65],"This":[66],"case":[67],"corresponds":[68],"well-studied":[71],"buy-at-bulk":[72],"admits":[77],"polylogarithmic":[78,163],"approximation":[79,164,175],"hardness.":[81],"In":[82],"this":[83,168,195],"paper,":[84],"we":[85,184,253],"less-studied":[89],"scenario":[90],"1$":[94],"positive":[97],"start-up":[98],"$\\sigma":[100],"Now,":[103],"neither":[109],"subadditive":[110],"nor":[111],"superadditive.":[112],"It":[113],"aims":[114],"model":[116],"range":[118],"computing":[120],"communication":[122],"devices":[123],"which":[125,160,269],"doubling":[126],"processing":[127],"speed":[128],"more":[129],"than":[130],"doubles":[131],"their":[132],"power":[133],"consumption.":[134],"begin":[136],"by":[137,170],"discussing":[138],"why":[139],"existing":[140],"routing":[141,236],"techniques":[142,257],"such":[143],"as":[144],"randomized":[145],"rounding":[146],"tree-metric":[148],"embedding":[149],"fail":[150],"generalize":[152],"directly.":[153],"then":[155],"present":[156],"our":[157],"main":[158],"contribution,":[159],"algorithm.":[165],"obtain":[167],"result":[169],"first":[171],"deriving":[172],"bicriteria":[174],"related":[178],"capacitated":[179],"flow":[181],"that":[183,258],"believe":[185],"interesting":[187],"in":[188,237,274],"its":[189],"own":[190],"right.":[191],"Our":[192],"approach":[193],"builds":[197],"upon":[198],"well-linked":[200],"decomposition":[201],"due":[202,223,240],"Chekuri,":[204],"Khanna,":[205],"Shepherd":[207],"[Proceedings":[208],"ACM":[210],"STOC,":[211],"ACM,":[212,230],"New":[213],"York,":[214],"pp.":[215,250],"183--192],":[216],"construction":[218],"expanders":[220],"via":[221],"matchings":[222],"Khandekar,":[225],"Rao,":[226],"Vazirani":[228],"[J.":[229],"56":[231],"(2009),":[232],"19],":[233],"edge-disjoint":[235],"well-connected":[238],"graphs":[239],"Rao":[242],"Zhou":[244],"[SIAM":[245],"J.":[246],"Comput.,":[247],"39":[248],"(2010),":[249],"1856--1887].":[251],"However,":[252],"also":[254],"develop":[255],"new":[256],"allow":[259],"us":[260],"keep":[262],"handle":[264],"cost,":[268],"was":[270],"not":[271],"concern":[273],"aforementioned":[276],"literature.":[277]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":5},{"year":2018,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}