{"id":"https://openalex.org/W3163298847","doi":"https://doi.org/10.1145/3182395","title":"Beating Approximation Factor Two for Weighted Tree Augmentation with Bounded Costs","display_name":"Beating Approximation Factor Two for Weighted Tree Augmentation with Bounded Costs","publication_year":2018,"publication_date":"2018-12-07","ids":{"openalex":"https://openalex.org/W3163298847","doi":"https://doi.org/10.1145/3182395","mag":"3163298847"},"language":"en","primary_location":{"id":"doi:10.1145/3182395","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3182395","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","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/A5015422703","display_name":"David Adjiashvili","orcid":null},"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":true,"raw_author_name":"David Adjiashvili","raw_affiliation_strings":["ETH Zurich, Switzerland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ETH Zurich, Switzerland","institution_ids":["https://openalex.org/I35440088"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5015422703"],"corresponding_institution_ids":["https://openalex.org/I35440088"],"apc_list":null,"apc_paid":null,"fwci":0.4299,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.69144144,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":98},"biblio":{"volume":"15","issue":"2","first_page":"1","last_page":"26"},"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.9994000196456909,"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.9994000196456909,"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.9968000054359436,"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.9923999905586243,"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/mathematics","display_name":"Mathematics","score":0.6957269906997681},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.637336790561676},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6150434017181396},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.548141598701477},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.536679744720459},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5243066549301147},{"id":"https://openalex.org/keywords/rounding","display_name":"Rounding","score":0.4767504632472992},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.4628123342990875},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4555169641971588},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.26143956184387207},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.16642919182777405},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.12344563007354736}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6957269906997681},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.637336790561676},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6150434017181396},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.548141598701477},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.536679744720459},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5243066549301147},{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.4767504632472992},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.4628123342990875},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4555169641971588},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.26143956184387207},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.16642919182777405},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.12344563007354736},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3182395","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3182395","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1577105815","https://openalex.org/W1978176066","https://openalex.org/W2002452451","https://openalex.org/W2002923907","https://openalex.org/W2029830880","https://openalex.org/W2051699458","https://openalex.org/W2057915045","https://openalex.org/W2172955861","https://openalex.org/W2287418059","https://openalex.org/W2326678228","https://openalex.org/W2963550906","https://openalex.org/W2988480584","https://openalex.org/W4302933860","https://openalex.org/W6743614329"],"related_works":["https://openalex.org/W2035016254","https://openalex.org/W3100114454","https://openalex.org/W2507810539","https://openalex.org/W2543175834","https://openalex.org/W1600160158","https://openalex.org/W2137277194","https://openalex.org/W3175189485","https://openalex.org/W4287593987","https://openalex.org/W2561769964","https://openalex.org/W4287552035"],"abstract_inverted_index":{"The":[0,77],"Weighted":[1],"Tree":[2,93],"Augmentation":[3,94],"Problem":[4,95],"(WTAP)":[5],"is":[6,74,90,157,178,270,284],"a":[7,43,57,158,211,218,235,250,304,318],"fundamental":[8],"well-studied":[9],"problem":[10],"in":[11,113,144,264,286,295],"the":[12,64,92,98,106,179,182,185,192,223,226,229,241,253,258,261,268,281,287,293,296,300,307,325],"field":[13],"of":[14,30,100,188,195,215,252,267],"network":[15],"design.":[16],"Given":[17],"an":[18,27,132,273],"undirected":[19],"tree":[20,242],"G":[21],"=(":[22],"V":[23,34,36,68],",":[24,52,69,169],"E":[25,39,70],"),":[26],"additional":[28],"set":[29,59],"edges":[31],"L":[32,51,62,89,148],"\u2291":[33,61],"\u00d7":[35],"disjoint":[37],"from":[38],"called":[40,91],"links":[41],"and":[42,126,184,217,246,280],"cost":[44,102,141,187],"vector":[45],"c":[46,81,143,173,176],"\u2208":[47,88,122],"R":[48,123],"\u2265":[49,124],"0":[50],"WTAP":[53,112,138,216],"asks":[54],"to":[55,140,201,233,272,306,323],"find":[56],"minimum-cost":[58],"F":[60,72],"with":[63,162,249,276],"property":[65],"that":[66,239,313],"(":[67],"\u222a":[71],")":[73],"2-edge":[75],"connected.":[76],"special":[78,193],"case":[79,194],"where":[80,170],"\u2113":[82,87],"=":[83,172],"1":[84,125],"for":[85,111,119,137,149],"all":[86],"(TAP).":[96],"For":[97,191],"class":[99],"bounded":[101],"vectors,":[103],"we":[104,130,197],"present":[105,131],"first":[107,224],"improved":[108],"approximation":[109,320,327],"algorithm":[110,161,227],"more":[114],"than":[115],"three":[116],"decades.":[117],"Concretely,":[118],"any":[120,189],"M":[121,146],"\u03b5":[127],">":[128],"0,":[129],"LP":[133,213,231,255],"based":[134],"(\u03bc":[135,159],"+\u03f5)-approximation":[136,160],"restricted":[139],"vectors":[142],"[1,":[145],"]":[147],"\u03bc":[150],"\u2248":[151],"1.96417.":[152],"More":[153],"generally,":[154],"our":[155],"result":[156],"running":[163],"time":[164],"n":[165],"r":[166,171],"O":[167],"(1)":[168],"max":[174],"/":[175],"min":[177],"ratio":[180],"between":[181],"largest":[183],"smallest":[186],"link.":[190],"TAP,":[196],"improve":[198],"this":[199],"factor":[200],"5/3+\u03f5.":[202],"Our":[203],"results":[204],"rely":[205],"on":[206],"several":[207],"new":[208,212,297],"ideas,":[209],"including":[210],"relaxation":[214],"two-phase":[219],"rounding":[220,278,290],"algorithm.":[221],"In":[222,257],"phase,":[225,260],"uses":[228],"fractional":[230,262],"solution":[232,263,275],"guide":[234],"simple":[236],"decomposition":[237,269],"method":[238],"breaks":[240],"into":[243],"well-structured":[244],"trees":[245],"equips":[247],"each":[248,265],"part":[251,266],"fraction":[254],"solution.":[256,288],"second":[259],"rounded":[271],"integral":[274],"two":[277],"procedures":[279,315],"best":[282],"outcome":[283],"included":[285],"One":[289],"procedure":[291],"exploits":[292,303],"constraints":[294],"LP,":[298],"while":[299],"other":[301],"one":[302],"connection":[305],"Edge":[308],"Cover":[309],"Problem.":[310],"We":[311],"show":[312],"both":[314],"cannot":[316],"have":[317],"bad":[319],"guarantee":[321],"simultaneously":[322],"obtain":[324],"claimed":[326],"factor.":[328]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}