{"id":"https://openalex.org/W2143481766","doi":"https://doi.org/10.1137/s0097539704441241","title":"The Directed Steiner Network Problem is Tractable for a Constant Number of Terminals","display_name":"The Directed Steiner Network Problem is Tractable for a Constant Number of Terminals","publication_year":2006,"publication_date":"2006-01-01","ids":{"openalex":"https://openalex.org/W2143481766","doi":"https://doi.org/10.1137/s0097539704441241","mag":"2143481766"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539704441241","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539704441241","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/A5042697545","display_name":"Jon Feldman","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jon Feldman","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5048492425","display_name":"Matthias R\u00fchl","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Matthias Ruhl","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":1.3309,"has_fulltext":false,"cited_by_count":36,"citation_normalized_percentile":{"value":0.81658563,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"36","issue":"2","first_page":"543","last_page":"561"},"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.9994999766349792,"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.9994999766349792,"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.9990000128746033,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9966999888420105,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/combinatorics","display_name":"Combinatorics","score":0.84590744972229},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.8234902620315552},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7527656555175781},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.6431772112846375},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5239203572273254},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5124314427375793},{"id":"https://openalex.org/keywords/induced-subgraph","display_name":"Induced subgraph","score":0.4711509943008423},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.45410168170928955},{"id":"https://openalex.org/keywords/vertex-connectivity","display_name":"Vertex connectivity","score":0.4501497745513916},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.4242766499519348},{"id":"https://openalex.org/keywords/connectivity","display_name":"Connectivity","score":0.4201824963092804},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.16067832708358765},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.07054087519645691}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.84590744972229},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.8234902620315552},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7527656555175781},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.6431772112846375},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5239203572273254},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5124314427375793},{"id":"https://openalex.org/C2778012994","wikidata":"https://www.wikidata.org/wiki/Q24743362","display_name":"Induced subgraph","level":4,"score":0.4711509943008423},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.45410168170928955},{"id":"https://openalex.org/C2983226441","wikidata":"https://www.wikidata.org/wiki/Q3115621","display_name":"Vertex connectivity","level":4,"score":0.4501497745513916},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.4242766499519348},{"id":"https://openalex.org/C76444178","wikidata":"https://www.wikidata.org/wiki/Q72897900","display_name":"Connectivity","level":3,"score":0.4201824963092804},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.16067832708358765},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.07054087519645691},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/s0097539704441241","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539704441241","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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1991636386","https://openalex.org/W1996668544","https://openalex.org/W2035363092","https://openalex.org/W2077731214","https://openalex.org/W2084224084","https://openalex.org/W2084876869","https://openalex.org/W2088820959","https://openalex.org/W2127240180","https://openalex.org/W2132087752","https://openalex.org/W2160365857","https://openalex.org/W2171985270"],"related_works":["https://openalex.org/W1984251932","https://openalex.org/W2014594560","https://openalex.org/W2049969628","https://openalex.org/W3022066884","https://openalex.org/W2792939965","https://openalex.org/W2039349395","https://openalex.org/W2548944478","https://openalex.org/W2952845665","https://openalex.org/W4300671851","https://openalex.org/W4210765591"],"abstract_inverted_index":{"We":[0,79],"consider":[1],"the":[2,9,29,35,59,70,82,103,108,112,123,142,148,154],"Directed":[3,60],"Steiner":[4,61,126],"Network":[5],"problem,":[6],"also":[7],"called":[8],"Point\u2010to\u2010Point":[10],"Connection":[11],"problem.":[12],"Given":[13],"a":[14,65,135],"directed":[15,136],"graph":[16,137],"G":[17,40,99],"and":[18,96,102,138],"p":[19,88,139,155],"pairs":[20],"$\\{":[21],"(s_1,t_1),":[22],"\\dotsc,":[23],"(s_p,t_p)":[24],"\\}$":[25],"of":[26,39,111],"nodes":[27,95,140],"in":[28,98,141],"graph,":[30,143],"one":[31,144],"has":[32,145],"to":[33,46,106,146],"find":[34],"smallest":[36,149],"subgraph":[37,113,152],"H":[38],"that":[41,81],"contains":[42],"paths":[43],"from":[44],"$s_i$":[45],"$t_i$":[47],"for":[48,55,74,122,129],"all":[49],"i.":[50],"The":[51],"problem":[52,63,83,128],"is":[53,64,84,89,105],"NP\u2010hard":[54],"general":[56],"p,":[57,132],"since":[58],"Tree":[62],"special":[66],"case.":[67],"Until":[68],"now,":[69],"complexity":[71],"was":[72],"unknown":[73],"constant":[75,91,131],"$p":[76],"\\geq":[77],"3$.":[78],"prove":[80],"polynomially":[85],"solvable":[86],"if":[87,94],"any":[90,130],"number,":[92],"even":[93],"edges":[97],"are":[100],"weighted":[101],"goal":[104],"minimize":[107],"total":[109],"weight":[110],"H.":[114],"In":[115],"addition,":[116],"we":[117],"give":[118],"an":[119],"efficient":[120],"algorithm":[121],"Strongly":[124],"Connected":[125],"Subgraph":[127],"where":[133],"given":[134],"compute":[147],"strongly":[150],"connected":[151],"containing":[153],"nodes.":[156]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}