{"id":"https://openalex.org/W7147342919","doi":"https://doi.org/10.48550/arxiv.2603.29582","title":"A Strong Linear Programming Relaxation for Weighted Tree Augmentation","display_name":"A Strong Linear Programming Relaxation for Weighted Tree Augmentation","publication_year":2026,"publication_date":"2026-03-31","ids":{"openalex":"https://openalex.org/W7147342919","doi":"https://doi.org/10.48550/arxiv.2603.29582"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2603.29582","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.29582","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2603.29582","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5132607494","display_name":"Vincent Cohen-Addad","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Cohen-Addad, Vincent","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5132594731","display_name":"Marina Drygala","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Drygala, Marina","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5014157604","display_name":"Nathan Klein","orcid":"https://orcid.org/0009-0003-4052-5864"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Klein, Nathan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5046999727","display_name":"Ola Svensson","orcid":"https://orcid.org/0000-0003-2997-1372"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Svensson, Ola","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"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.5533000230789185,"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.5533000230789185,"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.11330000311136246,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.09359999746084213,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.8148999810218811},{"id":"https://openalex.org/keywords/randomized-rounding","display_name":"Randomized rounding","score":0.7095000147819519},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.6610999703407288},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.6007999777793884},{"id":"https://openalex.org/keywords/rounding","display_name":"Rounding","score":0.5805000066757202},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5608000159263611},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5275999903678894},{"id":"https://openalex.org/keywords/set-cover-problem","display_name":"Set cover problem","score":0.49799999594688416}],"concepts":[{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.8148999810218811},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7601000070571899},{"id":"https://openalex.org/C32029473","wikidata":"https://www.wikidata.org/wiki/Q7292010","display_name":"Randomized rounding","level":3,"score":0.7095000147819519},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.6610999703407288},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.6007999777793884},{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.5805000066757202},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5608000159263611},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5275999903678894},{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.49799999594688416},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4846000075340271},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.42480000853538513},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3856000006198883},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37610000371932983},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3734999895095825},{"id":"https://openalex.org/C160824197","wikidata":"https://www.wikidata.org/wiki/Q2071054","display_name":"Linear approximation","level":3,"score":0.3682999908924103},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.361299991607666},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.3368000090122223},{"id":"https://openalex.org/C91765299","wikidata":"https://www.wikidata.org/wiki/Q3424292","display_name":"Lagrangian relaxation","level":2,"score":0.3084999918937683},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.30660000443458557},{"id":"https://openalex.org/C145242015","wikidata":"https://www.wikidata.org/wiki/Q774123","display_name":"Approximation theory","level":2,"score":0.2874999940395355},{"id":"https://openalex.org/C13355873","wikidata":"https://www.wikidata.org/wiki/Q2920850","display_name":"Connection (principal bundle)","level":2,"score":0.27230000495910645},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.2662999927997589},{"id":"https://openalex.org/C148043351","wikidata":"https://www.wikidata.org/wiki/Q4456944","display_name":"Current (fluid)","level":2,"score":0.2547000050544739},{"id":"https://openalex.org/C103646786","wikidata":"https://www.wikidata.org/wiki/Q5179260","display_name":"Covering problems","level":3,"score":0.251800000667572}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2603.29582","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.29582","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2603.29582","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.29582","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0],"Weighted":[1],"Tree":[2],"Augmentation":[3],"Problem":[4],"(WTAP)":[5],"is":[6,15,34,46,99],"a":[7,18,32,73,85,105],"fundamental":[8],"network":[9],"design":[10],"problem":[11],"where":[12],"the":[13,37,41,78,121],"goal":[14],"to":[16,25,48,124],"find":[17],"minimum-cost":[19],"set":[20],"of":[21,40,64,75,118],"additional":[22],"edges":[23,119],"(links)":[24],"make":[26],"an":[27,92],"input":[28],"tree":[29],"2-edge-connected.":[30],"While":[31],"2-approximation":[33],"standard":[35],"and":[36,66,103,120],"integrality":[38],"gap":[39],"classic":[42],"Cut":[43],"LP":[44],"relaxation":[45,109],"known":[47],"be":[49],"at":[50],"least":[51],"1.5,":[52],"achieving":[53],"approximation":[54,87,93],"factors":[55],"significantly":[56],"below":[57,95],"2":[58],"has":[59],"proven":[60],"challenging.":[61],"Recent":[62],"advances":[63],"Traub":[65],"Zenklusen":[67],"using":[68],"local":[69],"search":[70],"culminated":[71],"in":[72],"ratio":[74,94],"$1.5+\u03b5$,":[76],"establishing":[77],"state-of-the-art.":[79],"In":[80],"this":[81],"work,":[82],"we":[83],"present":[84],"randomized":[86],"algorithm":[88],"for":[89,110],"WTAP":[90,111],"with":[91],"1.49.":[96],"Our":[97],"approach":[98],"based":[100],"on":[101],"designing":[102],"rounding":[104],"strong":[106],"linear":[107],"programming":[108],"which":[112],"incorporates":[113],"variables":[114],"that":[115],"represent":[116],"subsets":[117],"links":[122],"used":[123],"cover":[125],"them,":[126],"inspired":[127],"by":[128],"lift-and-project":[129],"methods":[130],"like":[131],"Sherali-Adams.":[132]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-04-02T00:00:00"}