{"id":"https://openalex.org/W4408488474","doi":"https://doi.org/10.1145/3722101","title":"Better-Than-2 Approximations for Weighted Tree Augmentation and Applications to Steiner Tree","display_name":"Better-Than-2 Approximations for Weighted Tree Augmentation and Applications to Steiner Tree","publication_year":2025,"publication_date":"2025-03-16","ids":{"openalex":"https://openalex.org/W4408488474","doi":"https://doi.org/10.1145/3722101"},"language":"en","primary_location":{"id":"doi:10.1145/3722101","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3722101","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.1145/3722101","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5065421870","display_name":"Vera Traub","orcid":"https://orcid.org/0000-0001-9749-2600"},"institutions":[{"id":"https://openalex.org/I135140700","display_name":"University of Bonn","ror":"https://ror.org/041nas322","country_code":"DE","type":"education","lineage":["https://openalex.org/I135140700"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Vera Traub","raw_affiliation_strings":["University of Bonn,  Bonn, Germany"],"raw_orcid":"https://orcid.org/0000-0001-9749-2600","affiliations":[{"raw_affiliation_string":"University of Bonn,  Bonn, Germany","institution_ids":["https://openalex.org/I135140700"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5033406324","display_name":"Rico Zenklusen","orcid":"https://orcid.org/0000-0002-7148-9304"},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Rico Zenklusen","raw_affiliation_strings":["ETH Zurich,  Zurich, Switzerland"],"raw_orcid":"https://orcid.org/0000-0002-7148-9304","affiliations":[{"raw_affiliation_string":"ETH Zurich,  Zurich, Switzerland","institution_ids":["https://openalex.org/I35440088"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.6561,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.89846616,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":98,"max":99},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"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.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"}},"topics":[{"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.996999979019165,"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/T10142","display_name":"Formal Methods in Verification","score":0.9944000244140625,"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.9354367256164551},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5910904407501221},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5255916118621826},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.47697433829307556},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.45066818594932556},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.4502633213996887},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.34082216024398804},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.24050289392471313},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.0731903612613678}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.9354367256164551},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5910904407501221},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5255916118621826},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.47697433829307556},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.45066818594932556},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.4502633213996887},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.34082216024398804},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.24050289392471313},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.0731903612613678}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3722101","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3722101","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1145/3722101","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3722101","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":38,"referenced_works":["https://openalex.org/W1519758470","https://openalex.org/W1577105815","https://openalex.org/W1963899113","https://openalex.org/W1976584101","https://openalex.org/W1986126741","https://openalex.org/W1996668544","https://openalex.org/W2002452451","https://openalex.org/W2002923907","https://openalex.org/W2027029507","https://openalex.org/W2051699458","https://openalex.org/W2052687843","https://openalex.org/W2056824842","https://openalex.org/W2057915045","https://openalex.org/W2092113566","https://openalex.org/W2134875769","https://openalex.org/W2157338118","https://openalex.org/W2172955861","https://openalex.org/W2287418059","https://openalex.org/W2326678228","https://openalex.org/W2571094786","https://openalex.org/W2791470040","https://openalex.org/W2949889202","https://openalex.org/W2963550906","https://openalex.org/W2988480584","https://openalex.org/W3105989759","https://openalex.org/W3122114375","https://openalex.org/W3155451407","https://openalex.org/W3177131004","https://openalex.org/W3182381989","https://openalex.org/W4233583517","https://openalex.org/W4240507476","https://openalex.org/W4281662460","https://openalex.org/W4285214451","https://openalex.org/W4308244924","https://openalex.org/W4316652357","https://openalex.org/W4376651388","https://openalex.org/W4389615663","https://openalex.org/W4389615669"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W3187836939","https://openalex.org/W1524393328","https://openalex.org/W2739242419","https://openalex.org/W4244816249","https://openalex.org/W2150253898","https://openalex.org/W1595291551","https://openalex.org/W2183636263","https://openalex.org/W2045906087","https://openalex.org/W3042441286"],"abstract_inverted_index":{"We":[0],"present":[1,128],"the":[2,7,15,75,87,92,160,171,192,199,209],"first":[3],"approximation":[4,17,175],"algorithms":[5],"for":[6,52,85,115,156,159],"Weighted":[8],"Tree":[9,162],"Augmentation":[10],"Problem":[11],"(WTAP)":[12],"that":[13,51,94,117],"beat":[14],"longstanding":[16],"factor":[18,176],"of":[19,30,43,55,82,147,177,208],"2,":[20],"which":[21,83],"can":[22,96,202],"be":[23,204],"achieved":[24],"through":[25,102],"standard":[26],"techniques.":[27],"The":[28,47,144],"core":[29],"our":[31,106,186],"approach":[32,130,149,187],"is":[33,70,118,188],"a":[34,40,56,65,71,103,111,119,152],"novel":[35],"decomposition":[36,48,107],"theorem":[37,49,108],"based":[38],"on":[39,133],"well-chosen":[41,139],"class":[42],"thin":[44,79,100],"components":[45,101],".":[46],"asserts":[50],"any":[53],"pair":[54],"highly":[57],"structured":[58,88],"(but":[59],"potentially":[60],"expensive)":[61],"WTAP":[62,67,116],"solution":[63,77,200],"and":[64,217],"cheaper":[66,76],"solution,":[68],"there":[69],"way":[72,168,220],"to":[73,110,131,151,169,183,194,214,221],"decompose":[74],"into":[78],"components,":[80],"one":[81],"allows":[84],"improving":[86],"solution.":[89],"Together":[90],"with":[91],"fact":[93],"we":[95,127],"efficiently":[97],"optimize":[98],"over":[99],"dynamic":[104],"program,":[105],"leads":[109,150],"relative":[112,135],"greedy":[113,136],"algorithm":[114],"(1":[120],"+":[121,124,154,180],"ln":[122,178,227],"2":[123],"\u03f5)-approximation.":[125],"Moreover,":[126],"an":[129,166,196,215],"improve":[132],"some":[134],"procedures":[137],"by":[138,226],"(non-oblivious)":[140],"local":[141],"search":[142],"algorithms.":[143],"main":[145],"application":[146],"this":[148],"(1.5":[153],"\u03f5)-approximation":[155],"WTAP.":[157],"Furthermore,":[158],"Steiner":[161],"Problem,":[163],"it":[164],"provides":[165],"alternative":[167],"obtain":[170],"currently":[172],"best":[173],"known":[174],"4":[179],"\u03f5.":[181],"Contrary":[182],"prior":[184],"methods,":[185],"purely":[189],"combinatorial":[190],"without":[191],"need":[193],"solve":[195],"LP.":[197],"Nevertheless,":[198],"value":[201],"still":[203],"bounded":[205],"in":[206],"terms":[207],"well-known":[210],"hypergraphic":[211],"LP,":[212],"leading":[213],"alternative,":[216],"arguably":[218],"simpler,":[219],"bound":[222],"its":[223],"integrality":[224],"gap":[225],"4.":[228]},"counts_by_year":[{"year":2026,"cited_by_count":3}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}