{"id":"https://openalex.org/W2011823863","doi":"https://doi.org/10.1137/s0097539792236237","title":"When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks","display_name":"When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks","publication_year":1995,"publication_date":"1995-06-01","ids":{"openalex":"https://openalex.org/W2011823863","doi":"https://doi.org/10.1137/s0097539792236237","mag":"2011823863"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539792236237","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539792236237","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/A5110436285","display_name":"Ajit Agrawal","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ajit Agrawal","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5035567880","display_name":"Philip N. Klein","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Philip Klein","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5087844619","display_name":"R. Ravi","orcid":"https://orcid.org/0000-0001-7603-1207"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"R. Ravi","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":12.1031,"has_fulltext":false,"cited_by_count":421,"citation_normalized_percentile":{"value":0.99194415,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":100},"biblio":{"volume":"24","issue":"3","first_page":"440","last_page":"456"},"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.9958000183105469,"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.9958000183105469,"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.9940000176429749,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9894000291824341,"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.8367400169372559},{"id":"https://openalex.org/keywords/minimax","display_name":"Minimax","score":0.7228327989578247},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.683838963508606},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6393948793411255},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.5380427837371826},{"id":"https://openalex.org/keywords/reliability","display_name":"Reliability (semiconductor)","score":0.49884963035583496},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4881456792354584},{"id":"https://openalex.org/keywords/network-planning-and-design","display_name":"Network planning and design","score":0.4767899513244629},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.453861266374588},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.45316874980926514},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.42420652508735657},{"id":"https://openalex.org/keywords/value","display_name":"Value (mathematics)","score":0.42092710733413696},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.38005179166793823}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.8367400169372559},{"id":"https://openalex.org/C149728462","wikidata":"https://www.wikidata.org/wiki/Q751319","display_name":"Minimax","level":2,"score":0.7228327989578247},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.683838963508606},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6393948793411255},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.5380427837371826},{"id":"https://openalex.org/C43214815","wikidata":"https://www.wikidata.org/wiki/Q7310987","display_name":"Reliability (semiconductor)","level":3,"score":0.49884963035583496},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4881456792354584},{"id":"https://openalex.org/C114563136","wikidata":"https://www.wikidata.org/wiki/Q19725982","display_name":"Network planning and design","level":2,"score":0.4767899513244629},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.453861266374588},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.45316874980926514},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.42420652508735657},{"id":"https://openalex.org/C2776291640","wikidata":"https://www.wikidata.org/wiki/Q2912517","display_name":"Value (mathematics)","level":2,"score":0.42092710733413696},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.38005179166793823},{"id":"https://openalex.org/C163258240","wikidata":"https://www.wikidata.org/wiki/Q25342","display_name":"Power (physics)","level":2,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/s0097539792236237","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539792236237","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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.35.5192","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.35.5192","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://wilma.cs.brown.edu/pub/techreports/90/cs90-32.ps.Z","raw_type":"text"},{"id":"pmh:oai:repository.cmu.edu:tepper-1361","is_oa":false,"landing_page_url":"http://repository.cmu.edu/tepper/357","pdf_url":null,"source":{"id":"https://openalex.org/S7407050927","display_name":"KiltHub Repository","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I74973139","host_organization_name":"Carnegie Mellon University","host_organization_lineage":["https://openalex.org/I74973139"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Tepper School of Business","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W1592882366","https://openalex.org/W1973297532","https://openalex.org/W1975290397","https://openalex.org/W1979286451","https://openalex.org/W1990317614","https://openalex.org/W1992520677","https://openalex.org/W2007503572","https://openalex.org/W2012130001","https://openalex.org/W2016885155","https://openalex.org/W2020163691","https://openalex.org/W2020586530","https://openalex.org/W2042492403","https://openalex.org/W2043885806","https://openalex.org/W2050142375","https://openalex.org/W2064284095","https://openalex.org/W2068799282","https://openalex.org/W2082150701","https://openalex.org/W2115049345","https://openalex.org/W2115826669","https://openalex.org/W2115981193","https://openalex.org/W2117889403","https://openalex.org/W2140951480","https://openalex.org/W2142022975","https://openalex.org/W2172222998","https://openalex.org/W2401610261"],"related_works":["https://openalex.org/W2367195720","https://openalex.org/W1968497507","https://openalex.org/W1998126097","https://openalex.org/W1980288485","https://openalex.org/W2009976792","https://openalex.org/W3184075718","https://openalex.org/W2995411114","https://openalex.org/W2004321562","https://openalex.org/W328736688","https://openalex.org/W2404561224"],"abstract_inverted_index":{"We":[0],"give":[1],"the":[2,7,46,51,74,79,83,108,132],"first":[3],"approximation":[4,116],"algorithm":[5,54,117,127],"for":[6,26,118],"generalized":[8],"network":[9,15,22,44],"Steiner":[10],"problem,":[11],"a":[12,21,42,56,88,105,135],"problem":[13],"in":[14],"design.":[16],"An":[17],"instance":[18],"consists":[19],"of":[20,31,69,81,99,102,107,110,134],"with":[23],"link-costs":[24],"and,":[25],"each":[27],"pair":[28],"$\\{i,":[29],"j\\}$":[30],"nodes,":[32],"an":[33,115],"edgeconnectivity":[34],"requirement":[35,76],"$r_{ij}$.":[36],"The":[37],"goal":[38],"is":[39,60,73],"to":[40,96,130],"find":[41],"minimum-cost":[43,94],"using":[45],"available":[47],"links":[48],"and":[49],"satisfying":[50],"requirements.":[52],"Our":[53],"outputs":[55],"solution":[57],"whose":[58],"cost":[59],"within":[61],"$2":[62],"\\lceil":[63],"{\\log_{2}(r":[64],"+":[65],"1)}":[66],"\\rceil":[67],"$":[68],"optimal,":[70],"where":[71],"r":[72],"highest":[75],"value.":[77],"In":[78],"course":[80],"proving":[82],"performance":[84],"guarantee,":[85],"we":[86,113,123],"prove":[87],"combinatorial":[89],"minmax":[90],"approximate":[91],"equality":[92],"relating":[93],"networks":[95],"maximum":[97],"packings":[98],"certain":[100],"kinds":[101],"cuts.":[103],"As":[104],"consequence":[106],"proof":[109],"this":[111,126],"theorem,":[112],"obtain":[114],"optimally":[119],"packing":[120],"these":[121],"cuts;":[122],"show":[124],"that":[125],"has":[128],"application":[129],"estimating":[131],"reliability":[133],"probabilistic":[136],"network.":[137]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":9},{"year":2024,"cited_by_count":8},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":10},{"year":2021,"cited_by_count":16},{"year":2020,"cited_by_count":14},{"year":2019,"cited_by_count":10},{"year":2018,"cited_by_count":17},{"year":2017,"cited_by_count":15},{"year":2016,"cited_by_count":9},{"year":2015,"cited_by_count":12},{"year":2014,"cited_by_count":18},{"year":2013,"cited_by_count":18},{"year":2012,"cited_by_count":15}],"updated_date":"2026-08-15T07:11:24.734988","created_date":"2025-10-10T00:00:00"}