{"id":"https://openalex.org/W1991055327","doi":"https://doi.org/10.1145/1806689.1806769","title":"An improved LP-based approximation for steiner tree","display_name":"An improved LP-based approximation for steiner tree","publication_year":2010,"publication_date":"2010-06-05","ids":{"openalex":"https://openalex.org/W1991055327","doi":"https://doi.org/10.1145/1806689.1806769","mag":"1991055327"},"language":"en","primary_location":{"id":"doi:10.1145/1806689.1806769","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1806689.1806769","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-second ACM symposium on Theory of computing","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://hdl.handle.net/2108/30327","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5023591555","display_name":"Jaros\u0142aw Byrka","orcid":"https://orcid.org/0000-0002-3387-0913"},"institutions":[{"id":"https://openalex.org/I5124864","display_name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne","ror":"https://ror.org/02s376052","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I5124864"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Jaroslaw Byrka","raw_affiliation_strings":["EPFL, Lausanne, Switzerland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"EPFL, Lausanne, Switzerland","institution_ids":["https://openalex.org/I5124864"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5034276567","display_name":"Fabrizio Grandoni","orcid":"https://orcid.org/0000-0002-9676-4931"},"institutions":[{"id":"https://openalex.org/I116067653","display_name":"University of Rome Tor Vergata","ror":"https://ror.org/02p77k626","country_code":"IT","type":"education","lineage":["https://openalex.org/I116067653"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Fabrizio Grandoni","raw_affiliation_strings":["Universita di Roma Tor Vergata, Rome, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universita di Roma Tor Vergata, Rome, Italy","institution_ids":["https://openalex.org/I116067653"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5008952420","display_name":"Thomas Rothvo\u00df","orcid":"https://orcid.org/0009-0007-8314-0963"},"institutions":[{"id":"https://openalex.org/I5124864","display_name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne","ror":"https://ror.org/02s376052","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I5124864"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Thomas Rothvo\u00df","raw_affiliation_strings":["EPFL, Lausanne, Switzerland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"EPFL, Lausanne, Switzerland","institution_ids":["https://openalex.org/I5124864"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5051955401","display_name":"Laura Sanit\u00e0","orcid":"https://orcid.org/0000-0002-6384-1857"},"institutions":[{"id":"https://openalex.org/I5124864","display_name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne","ror":"https://ror.org/02s376052","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I5124864"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Laura Sanit\u00e0","raw_affiliation_strings":["EPFL, Lausanne, Switzerland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"EPFL, Lausanne, Switzerland","institution_ids":["https://openalex.org/I5124864"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":42.2667,"has_fulltext":false,"cited_by_count":299,"citation_normalized_percentile":{"value":1.0,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"583","last_page":"592"},"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.9988999962806702,"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.9988999962806702,"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.9952999949455261,"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.9767000079154968,"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.9503903388977051},{"id":"https://openalex.org/keywords/rounding","display_name":"Rounding","score":0.7212257385253906},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6842658519744873},{"id":"https://openalex.org/keywords/k-minimum-spanning-tree","display_name":"k-minimum spanning tree","score":0.6671169996261597},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6657177209854126},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6560426354408264},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.6078466176986694},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5505351424217224},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.5122012495994568},{"id":"https://openalex.org/keywords/randomized-rounding","display_name":"Randomized rounding","score":0.48682349920272827},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.4475652277469635},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.44469499588012695},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.43793782591819763},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.42276015877723694},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.41667377948760986},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.38658228516578674},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3480517566204071},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.32701438665390015},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.23047193884849548},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.1899503767490387},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.1305467188358307}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.9503903388977051},{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.7212257385253906},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6842658519744873},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.6671169996261597},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6657177209854126},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6560426354408264},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.6078466176986694},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5505351424217224},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.5122012495994568},{"id":"https://openalex.org/C32029473","wikidata":"https://www.wikidata.org/wiki/Q7292010","display_name":"Randomized rounding","level":3,"score":0.48682349920272827},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.4475652277469635},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.44469499588012695},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.43793782591819763},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.42276015877723694},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.41667377948760986},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.38658228516578674},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3480517566204071},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.32701438665390015},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.23047193884849548},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.1899503767490387},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.1305467188358307},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1145/1806689.1806769","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1806689.1806769","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-second ACM symposium on Theory of computing","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.163.326","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.163.326","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://disopt.epfl.ch/webdav/site/disopt/users/183730/public/lpsteiner.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.177.3565","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.177.3565","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://infoscience.epfl.ch/record/148220/files/SteinerTree-STOC2010.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.719.6796","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.719.6796","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://people.idsia.ch/%7Egrandoni/Pubblicazioni/BGRS10stoc.pdf","raw_type":"text"},{"id":"pmh:oai:art.torvergata.it:2108/30327","is_oa":true,"landing_page_url":"http://hdl.handle.net/2108/30327","pdf_url":null,"source":{"id":"https://openalex.org/S4306400993","display_name":"Cineca Institutional Research Information System (Tor Vergata University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I116067653","host_organization_name":"University of Rome Tor Vergata","host_organization_lineage":["https://openalex.org/I116067653"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:oai:infoscience.epfl.ch:148220","is_oa":true,"landing_page_url":"http://infoscience.epfl.ch/record/148220","pdf_url":null,"source":{"id":"https://openalex.org/S4306400487","display_name":"Infoscience (Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne)","issn_l":null,"issn":null,"is_oa":true,"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":"","raw_type":"Text"}],"best_oa_location":{"id":"pmh:oai:art.torvergata.it:2108/30327","is_oa":true,"landing_page_url":"http://hdl.handle.net/2108/30327","pdf_url":null,"source":{"id":"https://openalex.org/S4306400993","display_name":"Cineca Institutional Research Information System (Tor Vergata University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I116067653","host_organization_name":"University of Rome Tor Vergata","host_organization_lineage":["https://openalex.org/I116067653"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/conferenceObject"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320320915","display_name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne","ror":"https://ror.org/02s376052"},{"id":"https://openalex.org/F4320320924","display_name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung","ror":"https://ror.org/00yjd3n13"},{"id":"https://openalex.org/F4320322733","display_name":"Ministerstwo Edukacji i Nauki","ror":"https://ror.org/05dwvd537"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":53,"referenced_works":["https://openalex.org/W55191700","https://openalex.org/W109985799","https://openalex.org/W1504328953","https://openalex.org/W1520007244","https://openalex.org/W1531667076","https://openalex.org/W1557310162","https://openalex.org/W1579272824","https://openalex.org/W1759768216","https://openalex.org/W1965229006","https://openalex.org/W1971222832","https://openalex.org/W1979269423","https://openalex.org/W1980942794","https://openalex.org/W1995473411","https://openalex.org/W1996668544","https://openalex.org/W1998126097","https://openalex.org/W1998608896","https://openalex.org/W2001139415","https://openalex.org/W2011039300","https://openalex.org/W2011823863","https://openalex.org/W2012130001","https://openalex.org/W2012329067","https://openalex.org/W2020112047","https://openalex.org/W2027515293","https://openalex.org/W2033647570","https://openalex.org/W2037399196","https://openalex.org/W2039298646","https://openalex.org/W2052964302","https://openalex.org/W2054655788","https://openalex.org/W2056824842","https://openalex.org/W2060329104","https://openalex.org/W2068871408","https://openalex.org/W2070664846","https://openalex.org/W2086709935","https://openalex.org/W2090960684","https://openalex.org/W2094410510","https://openalex.org/W2096881311","https://openalex.org/W2114997377","https://openalex.org/W2119918317","https://openalex.org/W2121370879","https://openalex.org/W2130307064","https://openalex.org/W2147879413","https://openalex.org/W2153014861","https://openalex.org/W2165142526","https://openalex.org/W2340149117","https://openalex.org/W2501499209","https://openalex.org/W2611804663","https://openalex.org/W2977322974","https://openalex.org/W4210431029","https://openalex.org/W4246185962","https://openalex.org/W4250886557","https://openalex.org/W4285719527","https://openalex.org/W6602249631","https://openalex.org/W6844382842"],"related_works":["https://openalex.org/W974563791","https://openalex.org/W2739242419","https://openalex.org/W1595291551","https://openalex.org/W2980261836","https://openalex.org/W4244816249","https://openalex.org/W2183636263","https://openalex.org/W2999680961","https://openalex.org/W2050428285","https://openalex.org/W2096702260","https://openalex.org/W1991055327"],"abstract_inverted_index":{"The":[0],"Steiner":[1,68,86,114,185,194],"tree":[2,26,69,115,163],"problem":[3,40,60],"is":[4,61,64,95,211],"one":[5,119],"of":[6,20,33,120,129,149,173,181,199,208,229],"the":[7,28,35,46,82,112,127,130,134,154,165,179,205,218],"most":[8,176,213],"fundamental":[9],"NP-hard":[10],"problems:":[11],"given":[12],"a":[13,18,24,31,107,146,159,171,190,197,227],"weighted":[14],"undirected":[15],"graph":[16],"and":[17,138,151],"subset":[19],"terminal":[21,161],"nodes,":[22],"find":[23],"minimum-cost":[25,160],"spanning":[27,162],"terminals.":[29],"In":[30,77],"sequence":[32],"papers,":[34],"approximation":[36,83,91,192],"ratio":[37],"for":[38,67,85,111,145,193,226],"this":[39,78,143],"was":[41],"improved":[42],"from":[43],"2":[44,75],"to":[45,126,217],"current":[47],"best":[48],"1.55":[49],"[Robins,Zelikovsky-SIDMA'05].":[50],"All":[51],"these":[52,121],"algorithms":[53],"are":[54],"purely":[55],"combinatorial.":[56],"A":[57],"long-standing":[58],"open":[59,220],"whether":[62],"there":[63],"an":[65,89,182],"LP-relaxation":[66],"with":[70,123,158],"integrality":[71,206],"gap":[72,207],"smaller":[73],"than":[74],"[Vazirani,Rajagopalan-SODA'99].":[76],"paper":[79],"we":[80,202],"improve":[81],"factor":[84],"tree,":[87],"developing":[88],"LP-based":[90],"algorithm.":[92],"Our":[93,168],"algorithm":[94,169],"based":[96],"on":[97],"a,":[98],"seemingly":[99],"novel,":[100],"iterative":[101],"randomized":[102],"rounding":[103],"technique.":[104],"We":[105,117,141],"consider":[106],"directed-component":[108],"cut":[109],"relaxation":[110],"k-restricted":[113,184],"problem.":[116],"sample":[118],"components":[122,156],"probability":[124],"proportional":[125],"value":[128],"associated":[131],"variable":[132],"in":[133,164],"optimal":[135,183],"fractional":[136],"solution":[137,172],"contract":[139],"it.":[140],"iterate":[142],"process":[144],"proper":[147],"number":[148,228],"times":[150,178],"finally":[152],"output":[153],"sampled":[155],"together":[157],"remaining":[166],"graph.":[167],"delivers":[170],"cost":[174,180],"at":[175,212],"ln(4)":[177],"tree.":[186,195],"This":[187,222],"directly":[188],"implies":[189],"ln(4)+\u03b5<1.39":[191],"As":[196],"byproduct":[198],"our":[200,209],"analysis,":[201],"show":[203],"that":[204],"LP":[210],"$1.55$,":[214],"hence":[215],"answering":[216],"mentioned":[219],"question.":[221],"might":[223],"have":[224],"consequences":[225],"related":[230],"problems.":[231]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":6},{"year":2024,"cited_by_count":13},{"year":2023,"cited_by_count":7},{"year":2022,"cited_by_count":14},{"year":2021,"cited_by_count":9},{"year":2020,"cited_by_count":17},{"year":2019,"cited_by_count":20},{"year":2018,"cited_by_count":15},{"year":2017,"cited_by_count":9},{"year":2016,"cited_by_count":13},{"year":2015,"cited_by_count":18},{"year":2014,"cited_by_count":19},{"year":2013,"cited_by_count":36},{"year":2012,"cited_by_count":47}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}