{"id":"https://openalex.org/W7164049987","doi":"https://doi.org/10.1145/3798129.3800808","title":"Steiner Forest: A Simplified Better-Than-2 Approximation","display_name":"Steiner Forest: A Simplified Better-Than-2 Approximation","publication_year":2026,"publication_date":"2026-06-09","ids":{"openalex":"https://openalex.org/W7164049987","doi":"https://doi.org/10.1145/3798129.3800808"},"language":"en","primary_location":{"id":"doi:10.1145/3798129.3800808","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3798129.3800808","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 58th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"conference-paper","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/A5138258108","display_name":"Anupam Gupta","orcid":"https://orcid.org/0000-0001-5579-3405"},"institutions":[{"id":"https://openalex.org/I57206974","display_name":"New York University","ror":"https://ror.org/0190ak572","country_code":"US","type":"education","lineage":["https://openalex.org/I57206974"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Anupam Gupta","raw_affiliation_strings":["New York University, New York, USA"],"raw_orcid":"https://orcid.org/0000-0001-5579-3405","affiliations":[{"raw_affiliation_string":"New York University, New York, USA","institution_ids":["https://openalex.org/I57206974"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5065421870","display_name":"Vera Traub","orcid":"https://orcid.org/0000-0001-9749-2600"},"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":"Vera Traub","raw_affiliation_strings":["ETH Zurich, Zurich, Switzerland"],"raw_orcid":"https://orcid.org/0000-0001-9749-2600","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":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.68794593,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"943","last_page":"954"},"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.07599999755620956,"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.07599999755620956,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.07460000365972519,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.052000001072883606,"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/calculus","display_name":"Calculus (dental)","score":0.2630000114440918},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.2574000060558319},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.25690001249313354},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.25619998574256897},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.25369998812675476}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4959000051021576},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.35269999504089355},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.31529998779296875},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.30979999899864197},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3061000108718872},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.2721000015735626},{"id":"https://openalex.org/C2777686260","wikidata":"https://www.wikidata.org/wiki/Q144037","display_name":"Calculus (dental)","level":2,"score":0.2630000114440918},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.2574000060558319},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.25690001249313354},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.25619998574256897},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.25369998812675476},{"id":"https://openalex.org/C61797465","wikidata":"https://www.wikidata.org/wiki/Q1188986","display_name":"Term (time)","level":2,"score":0.25200000405311584}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3798129.3800808","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3798129.3800808","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 58th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},{"id":"pmh:doi:10.3929/ethz-c-000802390","is_oa":false,"landing_page_url":"http://hdl.handle.net/20.500.11850/802390","pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Conference Paper"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.43817487359046936,"id":"https://metadata.un.org/sdg/13","display_name":"Climate action"}],"awards":[{"id":"https://openalex.org/G3368893318","display_name":null,"funder_award_id":"CCF-2422926","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4234158736","display_name":null,"funder_award_id":"CCF-2608359","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1976584101","https://openalex.org/W2001139415","https://openalex.org/W2011823863","https://openalex.org/W2027515293","https://openalex.org/W2039298646","https://openalex.org/W2056824842","https://openalex.org/W2111072608","https://openalex.org/W2120899253","https://openalex.org/W2122195804","https://openalex.org/W2142779979","https://openalex.org/W2172955861","https://openalex.org/W2963996640","https://openalex.org/W4249586771","https://openalex.org/W4399521223","https://openalex.org/W4404848468","https://openalex.org/W4408259600","https://openalex.org/W4408488474","https://openalex.org/W4411187861","https://openalex.org/W7128618226"],"related_works":[],"abstract_inverted_index":{"In":[0,90],"the":[1,19,44,50,100,123,144,152,165],"Steiner":[2,149],"Forest":[3],"problem,":[4],"we":[5,93],"are":[6],"given":[7],"a":[8,14,24,53,72,84],"graph":[9],"with":[10,131],"edge":[11],"lengths,":[12],"and":[13,59,79,98,127,151],"collection":[15],"of":[16,26,102,122,154],"demand":[17,33],"pairs;":[18],"goal":[20],"is":[21,35],"to":[22,56,66,96,106,137,140],"find":[23,138],"subgraph":[25],"least":[27],"total":[28],"length":[29],"such":[30],"that":[31,159],"each":[32],"pair":[34],"connected":[36],"in":[37,71,143],"this":[38,68,91],"subgraph.":[39],"For":[40],"over":[41],"twenty":[42],"years,":[43],"best":[45],"approximation":[46],"ratio":[47],"known":[48],"for":[49,148,167],"problem":[51],"was":[52],"2-approximation":[54],"due":[55],"Agrawal,":[57],"Klein,":[58],"Ravi":[60],"(STOC":[61],"1991),":[62],"despite":[63],"many":[64],"attempts":[65],"surpass":[67],"bound.":[69],"Finally,":[70],"recent":[73],"breakthrough,":[74],"Ahmadi,":[75],"Gholami,":[76],"Hajiaghayi,":[77],"Jabbarzade,":[78],"Mahdavi":[80],"(FOCS":[81],"2025)":[82],"gave":[83],"2-\u03f5-approximation,":[85],"where":[86],"\u03f5":[87],"\u2248":[88],"10-11.":[89],"work,":[92],"show":[94],"how":[95],"simplify":[97],"extend":[99],"work":[101,117],"Ahmadi":[103],"et":[104],"al.":[105],"obtain":[107],"an":[108,119],"improved":[109],"1.994-approximation.":[110],"We":[111,157],"combine":[112],"some":[113],"ideas":[114,133],"from":[115],"their":[116],"(e.g.,":[118],"extended":[120],"run":[121],"moat-growing":[124],"primal-dual":[125],"algorithm,":[126],"identifying":[128],"autarkic":[129,155],"pairs)":[130],"other":[132],"-":[134],"submodular":[135],"maximization":[136],"components":[139],"contract,":[141],"as":[142],"relative":[145],"greedy":[146],"algorithms":[147],"tree,":[150],"use":[153],"triples.":[156],"hope":[158],"our":[160],"cleaner":[161],"abstraction":[162],"will":[163],"open":[164],"way":[166],"further":[168],"improvements.":[169]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2026-06-10T00:00:00"}