{"id":"https://openalex.org/W2018511415","doi":"https://doi.org/10.1145/1077464.1077470","title":"On network design problems: fixed cost flows and the covering steiner problem","display_name":"On network design problems: fixed cost flows and the covering steiner problem","publication_year":2005,"publication_date":"2005-07-01","ids":{"openalex":"https://openalex.org/W2018511415","doi":"https://doi.org/10.1145/1077464.1077470","mag":"2018511415"},"language":"en","primary_location":{"id":"doi:10.1145/1077464.1077470","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1077464.1077470","pdf_url":null,"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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5064059676","display_name":"Guy Even","orcid":"https://orcid.org/0000-0001-5407-330X"},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Guy Even","raw_affiliation_strings":["Tel-Aviv University, Tel-Aviv, Israel","Tel Aviv University, Tel Aviv, Israel,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Tel-Aviv University, Tel-Aviv, Israel","institution_ids":["https://openalex.org/I16391192"]},{"raw_affiliation_string":"Tel Aviv University, Tel Aviv, Israel,","institution_ids":["https://openalex.org/I16391192"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5056370891","display_name":"Guy Kortsarz","orcid":null},"institutions":[{"id":"https://openalex.org/I102322142","display_name":"Rutgers, The State University of New Jersey","ror":"https://ror.org/05vt9qd57","country_code":"US","type":"education","lineage":["https://openalex.org/I102322142"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Guy Kortsarz","raw_affiliation_strings":["Rutgers University, Camden, New Jersey"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Rutgers University, Camden, New Jersey","institution_ids":["https://openalex.org/I102322142"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5020640693","display_name":"Wolfgang Slany","orcid":"https://orcid.org/0000-0002-4979-6156"},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Wolfgang Slany","raw_affiliation_strings":["Technische Universit\u00e4t Wien, Wien, Austria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technische Universit\u00e4t Wien, Wien, Austria","institution_ids":["https://openalex.org/I145847075"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.656,"has_fulltext":false,"cited_by_count":44,"citation_normalized_percentile":{"value":0.95262309,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"1","issue":"1","first_page":"74","last_page":"101"},"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.998199999332428,"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.998199999332428,"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.989300012588501,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9868999719619751,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.8569211959838867},{"id":"https://openalex.org/keywords/minimum-cost-flow-problem","display_name":"Minimum-cost flow problem","score":0.7147184610366821},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.6040470004081726},{"id":"https://openalex.org/keywords/multi-commodity-flow-problem","display_name":"Multi-commodity flow problem","score":0.5832622051239014},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5479531288146973},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.48629769682884216},{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.4833680987358093},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4778580069541931},{"id":"https://openalex.org/keywords/tree-network","display_name":"Tree network","score":0.43427759408950806},{"id":"https://openalex.org/keywords/network-planning-and-design","display_name":"Network planning and design","score":0.43299853801727295},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4265033006668091},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.41220685839653015},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.41097235679626465},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.38582316040992737},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3258364200592041},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.30730584263801575},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.10411021113395691}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.8569211959838867},{"id":"https://openalex.org/C99545648","wikidata":"https://www.wikidata.org/wiki/Q2897180","display_name":"Minimum-cost flow problem","level":3,"score":0.7147184610366821},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.6040470004081726},{"id":"https://openalex.org/C170334043","wikidata":"https://www.wikidata.org/wiki/Q6934437","display_name":"Multi-commodity flow problem","level":3,"score":0.5832622051239014},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5479531288146973},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.48629769682884216},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.4833680987358093},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4778580069541931},{"id":"https://openalex.org/C2781010653","wikidata":"https://www.wikidata.org/wiki/Q12056602","display_name":"Tree network","level":3,"score":0.43427759408950806},{"id":"https://openalex.org/C114563136","wikidata":"https://www.wikidata.org/wiki/Q19725982","display_name":"Network planning and design","level":2,"score":0.43299853801727295},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4265033006668091},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.41220685839653015},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.41097235679626465},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.38582316040992737},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3258364200592041},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.30730584263801575},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.10411021113395691},{"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/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1077464.1077470","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1077464.1077470","pdf_url":null,"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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":43,"referenced_works":["https://openalex.org/W204341840","https://openalex.org/W589687616","https://openalex.org/W1520654985","https://openalex.org/W1537227355","https://openalex.org/W1544515183","https://openalex.org/W1575625195","https://openalex.org/W1579943307","https://openalex.org/W1590377549","https://openalex.org/W1886894449","https://openalex.org/W1952648253","https://openalex.org/W1970076003","https://openalex.org/W1970259241","https://openalex.org/W1977712294","https://openalex.org/W1991626387","https://openalex.org/W1991636386","https://openalex.org/W1999527816","https://openalex.org/W2005771129","https://openalex.org/W2009976792","https://openalex.org/W2011039300","https://openalex.org/W2011823863","https://openalex.org/W2022092881","https://openalex.org/W2029828838","https://openalex.org/W2033249500","https://openalex.org/W2034269606","https://openalex.org/W2040924621","https://openalex.org/W2041571997","https://openalex.org/W2045250339","https://openalex.org/W2066873408","https://openalex.org/W2087656024","https://openalex.org/W2105669398","https://openalex.org/W2112638680","https://openalex.org/W2127635925","https://openalex.org/W2127814549","https://openalex.org/W2140129354","https://openalex.org/W2145126253","https://openalex.org/W2147258429","https://openalex.org/W2171985270","https://openalex.org/W2229954659","https://openalex.org/W2295428206","https://openalex.org/W2476096155","https://openalex.org/W2610052675","https://openalex.org/W4231916799","https://openalex.org/W6649858426"],"related_works":["https://openalex.org/W3035974271","https://openalex.org/W3141113327","https://openalex.org/W3161514703","https://openalex.org/W2080904092","https://openalex.org/W2098682899","https://openalex.org/W1994440468","https://openalex.org/W1518391446","https://openalex.org/W4206915070","https://openalex.org/W2120679858","https://openalex.org/W1974503539"],"abstract_inverted_index":{"Network":[0],"design":[1,238],"problems,":[2,239],"such":[3,240],"as":[4,14,106,153],"generalizations":[5],"of":[6,30,36,39,92,155,177,183,201,233,309,316,373],"the":[7,28,31,34,37,40,50,58,147,156,169,175,178,181,184,198,210,213,221,251,287,307,317,331,338,366,370,387,390,396],"Steiner":[8,223,242,253,340,398],"Tree":[9,243,254],"Problem,":[10,244,249],"can":[11,123],"be":[12,124],"cast":[13],"edge-cost-flow":[15],"problems.":[16],"An":[17],"edge-cost":[18,165],"flow":[19,24,32,122,150,166,172,283,289],"problem":[20,25,103,187,359],"is":[21,99,104,151,160,195,264,294,319,381,389],"a":[22,46,69,138,163,269,282,291,354,358],"min-cost":[23],"in":[26,190,225,342],"which":[27],"cost":[29,292,308],"equals":[33],"sum":[35],"costs":[38],"edges":[41,110,207],"carrying":[42],"positive":[43],"flow.We":[44],"prove":[45,63],"hardness":[47],"result":[48],"for":[49,76,261,273,278,337,395],"Minimum":[51],"Edge":[52],"Cost":[53],"Flow":[54],"Problem":[55,224,341],"(MECF).":[56],"Using":[57],"one-round":[59],"two-prover":[60],"scenario,":[61],"we":[62],"that":[64,167,284,293],"MECF":[65,97],"does":[66],"not":[67,208],"admit":[68],"2":[70],"log":[71],"1-\u03b5":[72],"n":[73,87,299,325],"-ratio":[74],"approximation,":[75],"every":[77,127,130],"constant":[78],"\u03b5":[79,300],">":[80],"0,":[81],"unless":[82],"NP":[83],"\u2286":[84],"DTIME":[85],"(":[86,298,321],"polylogn":[88],").A":[89],"restricted":[90],"version":[91,232],"MECF,":[93,204],"called":[94,360],"Infinite":[95],"Capacity":[96],"(ICF),":[98],"defined.":[100],"The":[101,158,230,276,313,349],"ICF":[102,219,234,263,280],"defined":[105],"follows:":[107],"(i)":[108],"all":[109,206],"have":[111],"infinite":[112,216],"capacity,":[113],"(ii)":[114],"there":[115],"are":[116,347,351,402],"multiple":[117],"sources":[118],"and":[119,135,141,145,180,194,227,250,344],"sinks,":[120],"where":[121,328],"delivered":[125],"from":[126],"source":[128,134,203,211],"to":[129,161,197,357],"sink,":[131],"(iii)":[132],"each":[133],"sink":[136,214],"has":[137],"supply":[139],"amount":[140],"demand":[142],"amount,":[143],"respectively,":[144],"(iv)":[146],"required":[148,170,288,332],"total":[149,171,333],"given":[152],"part":[154],"input.":[157],"goal":[159],"find":[162],"minimum":[164],"meets":[168],"while":[173],"obeying":[174],"demands":[176],"sinks":[179],"supplies":[182],"sources.":[185],"This":[186],"naturally":[188],"arises":[189],"practical":[191],"scheduling":[192],"applications,":[193],"equivalent":[196],"special":[199],"case":[200],"single":[202],"with":[205],"touching":[209],"or":[212],"having":[215],"capacity.The":[217],"directed":[218,226,274,279,343,385],"generalizes":[220,235],"Covering":[222,339,397],"undirected":[228,231,262,345,364],"graphs.":[229],"several":[236],"network":[237],"as:":[241],"k":[245],"-MST,":[246],"Point-to-point":[247],"Connection":[248],"generalized":[252],"Problem.An":[255],"O":[256,297,320],"(log":[257],"x":[258,322,329],")-approximation":[259],"algorithm":[260,272,277,318,380,388,394],"presented.":[265,348],"We":[266],"also":[267],"present":[268],"bi-criteria":[270],"approximation":[271,335,367,371,393],"ICF.":[275],"finds":[281],"delivers":[285],"half":[286],"at":[290,295],"most":[296],"/\u03b5":[301],"4":[302],")":[303],"times":[304],"bigger":[305],"than":[306],"an":[310],"optimal":[311],"flow.":[312],"running":[314],"time":[315],"2/\u03b5":[323],"\u010b":[324],"1+1/\u03b5":[326],"),":[327],"denotes":[330],"flow.Randomized":[334],"algorithms":[336,350,401],"graphs":[346],"based":[352],"on":[353],"randomized":[355],"reduction":[356],"1/2-Group":[361],"Steiner.":[362],"In":[363,384],"graphs,":[365,386],"ratio":[368,372],"matches":[369],"Konjevod":[374],"et":[375],"al.":[376],"[2002].":[377],"However,":[378],"our":[379],"much":[382],"simpler.":[383],"first":[391],"nontrivial":[392],"Problem.":[399],"Deterministic":[400],"obtained":[403],"by":[404],"derandomization.":[405]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":2}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}