{"id":"https://openalex.org/W4206693354","doi":"https://doi.org/10.1007/s10107-021-01757-5","title":"Implications, conflicts, and reductions for Steiner trees","display_name":"Implications, conflicts, and reductions for Steiner trees","publication_year":2021,"publication_date":"2021-12-30","ids":{"openalex":"https://openalex.org/W4206693354","doi":"https://doi.org/10.1007/s10107-021-01757-5"},"language":"en","primary_location":{"id":"doi:10.1007/s10107-021-01757-5","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10107-021-01757-5","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10107-021-01757-5.pdf","source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s10107-021-01757-5.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5005949084","display_name":"Daniel Rehfeldt","orcid":"https://orcid.org/0000-0002-2877-074X"},"institutions":[{"id":"https://openalex.org/I195893171","display_name":"Zuse Institute Berlin","ror":"https://ror.org/02eva5865","country_code":"DE","type":"facility","lineage":["https://openalex.org/I195893171"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Daniel Rehfeldt","raw_affiliation_strings":["Applied Algorithmic Intelligence Methods Departement, Zuse Institute Berlin, Takustr. 7, 14195, Berlin, Germany"],"affiliations":[{"raw_affiliation_string":"Applied Algorithmic Intelligence Methods Departement, Zuse Institute Berlin, Takustr. 7, 14195, Berlin, Germany","institution_ids":["https://openalex.org/I195893171"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5066794150","display_name":"Thorsten Koch","orcid":"https://orcid.org/0000-0002-1967-0077"},"institutions":[{"id":"https://openalex.org/I195893171","display_name":"Zuse Institute Berlin","ror":"https://ror.org/02eva5865","country_code":"DE","type":"facility","lineage":["https://openalex.org/I195893171"]},{"id":"https://openalex.org/I4577782","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40","country_code":"DE","type":"education","lineage":["https://openalex.org/I4577782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Thorsten Koch","raw_affiliation_strings":["Applied Algorithmic Intelligence Methods Departement, Zuse Institute Berlin, Takustr. 7, 14195, Berlin, Germany","Chair of Software and Algorithms for Discrete Optimization, TU Berlin, Str. des 17. Juni 135, 10623, Berlin, Germany"],"affiliations":[{"raw_affiliation_string":"Applied Algorithmic Intelligence Methods Departement, Zuse Institute Berlin, Takustr. 7, 14195, Berlin, Germany","institution_ids":["https://openalex.org/I195893171"]},{"raw_affiliation_string":"Chair of Software and Algorithms for Discrete Optimization, TU Berlin, Str. des 17. Juni 135, 10623, Berlin, Germany","institution_ids":["https://openalex.org/I4577782"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5005949084"],"corresponding_institution_ids":["https://openalex.org/I195893171"],"apc_list":{"value":2190,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2190,"currency":"EUR","value_usd":2890},"fwci":1.666,"has_fulltext":true,"cited_by_count":18,"citation_normalized_percentile":{"value":0.8662212,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"197","issue":"2","first_page":"903","last_page":"966"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9976000189781189,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9976000189781189,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9958999752998352,"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"}},{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9954000115394592,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.8575447797775269},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.7407425045967102},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.5660239458084106},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.560283899307251},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.515242874622345},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4559422731399536},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.44486457109451294},{"id":"https://openalex.org/keywords/maximum-cut","display_name":"Maximum cut","score":0.43362098932266235},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.43216848373413086},{"id":"https://openalex.org/keywords/pace","display_name":"Pace","score":0.4291595220565796},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.41329607367515564},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3123202323913574},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2563881278038025},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.15792953968048096}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.8575447797775269},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.7407425045967102},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.5660239458084106},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.560283899307251},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.515242874622345},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4559422731399536},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.44486457109451294},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.43362098932266235},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.43216848373413086},{"id":"https://openalex.org/C2777526511","wikidata":"https://www.wikidata.org/wiki/Q691543","display_name":"Pace","level":2,"score":0.4291595220565796},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.41329607367515564},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3123202323913574},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2563881278038025},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.15792953968048096},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s10107-021-01757-5","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10107-021-01757-5","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10107-021-01757-5.pdf","source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1007/s10107-021-01757-5","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10107-021-01757-5","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10107-021-01757-5.pdf","source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2830037408","display_name":null,"funder_award_id":"05M14ZAM","funder_id":"https://openalex.org/F4320323015","funder_display_name":"Bundesministerium f\u00fcr Forschung und Technologie"},{"id":"https://openalex.org/G7504124291","display_name":null,"funder_award_id":"MATH+","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G8330397625","display_name":null,"funder_award_id":"Funding","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G8921868790","display_name":null,"funder_award_id":"05M14ZAM","funder_id":"https://openalex.org/F4320321114","funder_display_name":"Bundesministerium f\u00fcr Bildung und Forschung"},{"id":"https://openalex.org/G8928656450","display_name":null,"funder_award_id":"Projekt DEAL","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"},{"id":"https://openalex.org/F4320321114","display_name":"Bundesministerium f\u00fcr Bildung und Forschung","ror":"https://ror.org/04pz7b180"},{"id":"https://openalex.org/F4320323015","display_name":"Bundesministerium f\u00fcr Forschung und Technologie","ror":"https://ror.org/04pz7b180"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4206693354.pdf","grobid_xml":"https://content.openalex.org/works/W4206693354.grobid-xml"},"referenced_works_count":36,"referenced_works":["https://openalex.org/W124060458","https://openalex.org/W1481847403","https://openalex.org/W1486380325","https://openalex.org/W1576246148","https://openalex.org/W1593947471","https://openalex.org/W1608030126","https://openalex.org/W1747960360","https://openalex.org/W1849829953","https://openalex.org/W1976584101","https://openalex.org/W1979269423","https://openalex.org/W1990267895","https://openalex.org/W1996668544","https://openalex.org/W2004092973","https://openalex.org/W2004305790","https://openalex.org/W2008534472","https://openalex.org/W2020586530","https://openalex.org/W2039706936","https://openalex.org/W2058692618","https://openalex.org/W2068362339","https://openalex.org/W2078404396","https://openalex.org/W2106106289","https://openalex.org/W2122195804","https://openalex.org/W2122990988","https://openalex.org/W2155239253","https://openalex.org/W2163428398","https://openalex.org/W2170038379","https://openalex.org/W2401610261","https://openalex.org/W2522051431","https://openalex.org/W2528914664","https://openalex.org/W2603633927","https://openalex.org/W2904738818","https://openalex.org/W2914609335","https://openalex.org/W2963277542","https://openalex.org/W2963552748","https://openalex.org/W3025795274","https://openalex.org/W3092303158"],"related_works":["https://openalex.org/W2118320476","https://openalex.org/W2161182859","https://openalex.org/W1503036335","https://openalex.org/W2170923533","https://openalex.org/W2962740289","https://openalex.org/W2990058916","https://openalex.org/W2902898487","https://openalex.org/W2085427851","https://openalex.org/W1502497305","https://openalex.org/W4385652378"],"abstract_inverted_index":{"Abstract":[0],"The":[1,93,104],"Steiner":[2,70],"tree":[3,71],"problem":[4],"in":[5,15,41,145],"graphs":[6],"(SPG)":[7],"is":[8,106,166],"one":[9],"of":[10,32,38,45,83,90,111,129,177,184],"the":[11,19,33,36,39,46,57,62,74,81,84,87,130,140,152,174,178,194],"most":[12],"studied":[13],"problems":[14],"combinatorial":[16],"optimization.":[17],"In":[18],"past":[20],"10":[21],"years,":[22],"there":[23],"have":[24],"been":[25],"significant":[26],"advances":[27],"concerning":[28],"approximation":[29],"and":[30,61,116],"complexity":[31],"SPG.":[34],"However,":[35],"state":[37,82,176],"art":[40,85,179],"(practical)":[42],"exact":[43,99,146,162],"solution":[44,101],"SPG":[47,77,100,123,147,163],"has":[48],"remained":[49],"largely":[50],"unchallenged":[51],"for":[52,193],"almost":[53],"20":[54],"years.":[55],"While":[56],"DIMACS":[58],"Challenge":[59,64],"2014":[60],"PACE":[63],"2018":[65],"brought":[66],"renewed":[67],"interest":[68],"into":[69,155],"problems,":[72],"even":[73,172],"best":[75],"new":[76,122,153],"solvers":[78],"cannot":[79],"match":[80],"on":[86,108,180],"vast":[88],"majority":[89],"benchmark":[91,185],"instances.":[92],"following":[94],"article":[95,105],"seeks":[96],"to":[97,197],"advance":[98],"once":[102],"again.":[103],"based":[107],"a":[109,119,156],"combination":[110],"three":[112],"concepts:":[113],"Implications,":[114],"conflicts,":[115],"reductions.":[117],"As":[118],"result,":[120],"various":[121],"techniques":[124,132],"are":[125,133,143],"conceived.":[126],"Notably,":[127],"several":[128,191],"resulting":[131],"(provably)":[134],"stronger":[135],"than":[136],"well-known":[137],"methods":[138,154],"from":[139],"literature":[141],"that":[142,165],"used":[144],"algorithms.":[148],"Finally,":[149],"by":[150],"integrating":[151],"branch-and-cut":[157],"framework,":[158],"we":[159,188],"obtain":[160],"an":[161,181],"solver":[164],"not":[167],"only":[168],"competitive":[169],"with,":[170],"but":[171],"outperforms":[173],"current":[175],"extensive":[182],"collection":[183],"sets.":[186],"Furthermore,":[187],"can":[189],"solve":[190],"instances":[192],"first":[195],"time":[196],"optimality.":[198]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":1}],"updated_date":"2026-04-16T08:26:57.006410","created_date":"2025-10-10T00:00:00"}