{"id":"https://openalex.org/W2011461406","doi":"https://doi.org/10.1137/s1052623496313684","title":"Computing the Minimum Cost Pipe Network Interconnecting One Sink and Many Sources","display_name":"Computing the Minimum Cost Pipe Network Interconnecting One Sink and Many Sources","publication_year":1999,"publication_date":"1999-01-01","ids":{"openalex":"https://openalex.org/W2011461406","doi":"https://doi.org/10.1137/s1052623496313684","mag":"2011461406"},"language":"en","primary_location":{"id":"doi:10.1137/s1052623496313684","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s1052623496313684","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"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 Optimization","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/A5026230689","display_name":"Guoliang Xue","orcid":"https://orcid.org/0000-0002-5833-8894"},"institutions":[{"id":"https://openalex.org/I111236770","display_name":"University of Vermont","ror":"https://ror.org/0155zta11","country_code":"US","type":"education","lineage":["https://openalex.org/I111236770"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Guoliang Xue","raw_affiliation_strings":["The University of Vermont"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The University of Vermont","institution_ids":["https://openalex.org/I111236770"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5080622494","display_name":"Theodore P. Lillys","orcid":"https://orcid.org/0000-0003-0163-813X"},"institutions":[{"id":"https://openalex.org/I111236770","display_name":"University of Vermont","ror":"https://ror.org/0155zta11","country_code":"US","type":"education","lineage":["https://openalex.org/I111236770"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Theodore P. Lillys","raw_affiliation_strings":["University of Vermont"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Vermont","institution_ids":["https://openalex.org/I111236770"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110336315","display_name":"David E. Dougherty","orcid":null},"institutions":[{"id":"https://openalex.org/I111236770","display_name":"University of Vermont","ror":"https://ror.org/0155zta11","country_code":"US","type":"education","lineage":["https://openalex.org/I111236770"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"David E. Dougherty","raw_affiliation_strings":["The University of Vermont"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The University of Vermont","institution_ids":["https://openalex.org/I111236770"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I111236770"],"apc_list":null,"apc_paid":null,"fwci":0.9334,"has_fulltext":false,"cited_by_count":32,"citation_normalized_percentile":{"value":0.74235627,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"10","issue":"1","first_page":"22","last_page":"42"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9997000098228455,"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"}},"topics":[{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9997000098228455,"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/T10720","display_name":"Complexity and Algorithms in Graphs","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/T10142","display_name":"Formal Methods in Verification","score":0.9975000023841858,"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/steiner-tree-problem","display_name":"Steiner tree problem","score":0.8344597220420837},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.6337802410125732},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6262860298156738},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6158238649368286},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5573526620864868},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.45385298132896423},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.45345330238342285},{"id":"https://openalex.org/keywords/pruning","display_name":"Pruning","score":0.4245629608631134},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3933939039707184},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.1283402144908905}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.8344597220420837},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.6337802410125732},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6262860298156738},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6158238649368286},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5573526620864868},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.45385298132896423},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.45345330238342285},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.4245629608631134},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3933939039707184},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.1283402144908905},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C6557445","wikidata":"https://www.wikidata.org/wiki/Q173113","display_name":"Agronomy","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/s1052623496313684","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s1052623496313684","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"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 Optimization","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.713.3938","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.713.3938","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://optimization.asu.edu/papers/XUE-JNL-1999-SIOPT-V10-P22.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/6","display_name":"Clean water and sanitation","score":0.8700000047683716}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W95071424","https://openalex.org/W1528845632","https://openalex.org/W1961822357","https://openalex.org/W1975807353","https://openalex.org/W1990488643","https://openalex.org/W1990564186","https://openalex.org/W1998117457","https://openalex.org/W2006957315","https://openalex.org/W2017927472","https://openalex.org/W2022204379","https://openalex.org/W2029791926","https://openalex.org/W2045286914","https://openalex.org/W2060380213","https://openalex.org/W2070308700","https://openalex.org/W2072446998","https://openalex.org/W2081171157","https://openalex.org/W2086594463","https://openalex.org/W2086709935","https://openalex.org/W2088967712","https://openalex.org/W2114753568","https://openalex.org/W2117065890","https://openalex.org/W2137432509","https://openalex.org/W2157338118","https://openalex.org/W2168544235","https://openalex.org/W2171590300","https://openalex.org/W2799004609","https://openalex.org/W4231953510"],"related_works":["https://openalex.org/W4367047277","https://openalex.org/W3008006306","https://openalex.org/W2135297598","https://openalex.org/W4241170344","https://openalex.org/W2565939641","https://openalex.org/W1952419772","https://openalex.org/W1871536084","https://openalex.org/W2541174657","https://openalex.org/W1591147321","https://openalex.org/W2298220751"],"abstract_inverted_index":{"In":[0],"this":[1,121],"paper,":[2],"we":[3,97],"study":[4],"the":[5,9,32,43,47,50,82,101,116,141,161,164,170,195,202],"problem":[6,59,196],"of":[7,18,45,49,163,172],"computing":[8,191],"minimum":[10,57,76,83,117,149],"cost":[11,77,84,118,150],"pipe":[12,78,151],"network":[13,79,85,119],"interconnecting":[14],"a":[15,21,28,36,54,75,87,127,135,148,186],"given":[16,29,93,122],"set":[17],"wells":[19],"and":[20,31,66,174],"treatment":[22,33],"site,":[23],"where":[24],"each":[25,92],"well":[26],"has":[27,35,61],"capacity":[30,37],"site":[34],"that":[38,72,80,138],"is":[39,53,81,111,157,198],"no":[40],"less":[41],"than":[42],"sum":[44],"all":[46,100],"capacities":[48],"wells.":[51],"This":[52],"generalized":[55],"Steiner":[56,89,95,143],"tree":[58],"which":[60,131],"applications":[62],"in":[63,67,104,134,145],"communication":[64],"networks":[65],"groundwater":[68],"treatment.":[69],"We":[70,124,167,184],"prove":[71,126],"there":[73],"exists":[74],"under":[86,120],"full":[88,94,142],"topology.":[90,123],"For":[91],"topology,":[96],"can":[98],"compute":[99],"edge":[102],"weights":[103],"linear":[105],"time.":[106],"A":[107,153],"powerful":[108],"interior-point":[109],"algorithm":[110,156,180,189],"then":[112,168],"used":[113],"to":[114,159],"find":[115],"also":[125],"lower":[128],"bound":[129],"theorem":[130],"enables":[132],"pruning":[133],"backtrack":[136,165],"method":[137],"partially":[139],"enumerates":[140],"topologies":[144],"search":[146],"for":[147,181,190,201],"network.":[152],"heuristic":[154,188],"ordering":[155],"proposed":[158],"enhance":[160],"performance":[162],"algorithm.":[166,204],"define":[169],"notion":[171],"k-optimality":[173],"present":[175,185],"an":[176],"efficient":[177],"(polynomial":[178],"time)":[179],"checking":[182],"5-optimality.":[183],"5-optimal":[187],"good":[192],"solutions":[193],"when":[194],"size":[197],"too":[199],"large":[200],"exact":[203],"Computational":[205],"results":[206],"are":[207],"presented.":[208]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}