Live
Black Hat USADark ReadingBlack Hat AsiaAI BusinessAnthropic Found Emotion Circuits Inside Claude. They're Causing It to Blackmail People.DEV CommunityUnderstanding Transformers Part 1: How Transformers Understand Word OrderDEV CommunityI built an iOS app at 50 using AI tools. Here's what actually workedDEV CommunityDesign Cost-Optimized Compute SolutionsDEV CommunityCodeClone b4: from CLI tool to a real review surface for VS Code, Claude Desktop, and CodexDEV CommunityHow to Publish a Power BI Report and Embed it into a Website.DEV CommunityKVerify: A Two-Year Journey to Get Validation RightDEV CommunityHow I Used Swarm Intelligence to Catch a Race Condition Before It Hit ProductionDEV CommunityDark Dish Lab: A Cursed Recipe GeneratorDEV CommunityUpload Large Folders to Cloudflare R2DEV Community10x Genomics (TXG) Is Up 14.6% After Analyst Upgrade Highlights AI-Scale Spatial Genomics Initiative - simplywall.stGNews AI genomicsWhy Developer Productivity Engineering is UnderratedDEV CommunityBlack Hat USADark ReadingBlack Hat AsiaAI BusinessAnthropic Found Emotion Circuits Inside Claude. They're Causing It to Blackmail People.DEV CommunityUnderstanding Transformers Part 1: How Transformers Understand Word OrderDEV CommunityI built an iOS app at 50 using AI tools. Here's what actually workedDEV CommunityDesign Cost-Optimized Compute SolutionsDEV CommunityCodeClone b4: from CLI tool to a real review surface for VS Code, Claude Desktop, and CodexDEV CommunityHow to Publish a Power BI Report and Embed it into a Website.DEV CommunityKVerify: A Two-Year Journey to Get Validation RightDEV CommunityHow I Used Swarm Intelligence to Catch a Race Condition Before It Hit ProductionDEV CommunityDark Dish Lab: A Cursed Recipe GeneratorDEV CommunityUpload Large Folders to Cloudflare R2DEV Community10x Genomics (TXG) Is Up 14.6% After Analyst Upgrade Highlights AI-Scale Spatial Genomics Initiative - simplywall.stGNews AI genomicsWhy Developer Productivity Engineering is UnderratedDEV Community
AI NEWS HUBbyEIGENVECTOREigenvector

A Strong Linear Programming Relaxation for Weighted Tree Augmentation

arXiv cs.DSby [Submitted on 31 Mar 2026]April 1, 20261 min read1 views
Source Quiz

arXiv:2603.29582v1 Announce Type: new Abstract: The Weighted Tree Augmentation Problem (WTAP) is a fundamental network design problem where the goal is to find a minimum-cost set of additional edges (links) to make an input tree 2-edge-connected. While a 2-approximation is standard and the integrality gap of the classic Cut LP relaxation is known to be at least 1.5, achieving approximation factors significantly below 2 has proven challenging. Recent advances of Traub and Zenklusen using local search culminated in a ratio of $1.5+\epsilon$, establishing the state-of-the-art. In this work, we present a randomized approximation algorithm for WTAP with an approximation ratio below 1.49. Our approach is based on designing and rounding a strong linear programming relaxation for WTAP which incorp

View PDF HTML (experimental)

Abstract:The Weighted Tree Augmentation Problem (WTAP) is a fundamental network design problem where the goal is to find a minimum-cost set of additional edges (links) to make an input tree 2-edge-connected. While a 2-approximation is standard and the integrality gap of the classic Cut LP relaxation is known to be at least 1.5, achieving approximation factors significantly below 2 has proven challenging. Recent advances of Traub and Zenklusen using local search culminated in a ratio of $1.5+\epsilon$, establishing the state-of-the-art. In this work, we present a randomized approximation algorithm for WTAP with an approximation ratio below 1.49. Our approach is based on designing and rounding a strong linear programming relaxation for WTAP which incorporates variables that represent subsets of edges and the links used to cover them, inspired by lift-and-project methods like Sherali-Adams.

Comments: Full version of a paper accepted to STOC 2026

Subjects:

Data Structures and Algorithms (cs.DS)

Cite as: arXiv:2603.29582 [cs.DS]

(or arXiv:2603.29582v1 [cs.DS] for this version)

https://doi.org/10.48550/arXiv.2603.29582

arXiv-issued DOI via DataCite (pending registration)

Submission history

From: Marina Drygala [view email] [v1] Tue, 31 Mar 2026 11:03:58 UTC (96 KB)

Was this article helpful?

Sign in to highlight and annotate this article

AI
Ask AI about this article
Powered by Eigenvector · full article context loaded
Ready

Conversation starters

Ask anything about this article…

Daily AI Digest

Get the top 5 AI stories delivered to your inbox every morning.

More about

announcearxiv

Knowledge Map

Knowledge Map
TopicsEntitiesSource
A Strong Li…announcearxivarXiv cs.DS

Connected Articles — Knowledge Graph

This article is connected to other articles through shared AI topics and tags.

Knowledge Graph100 articles · 140 connections
Scroll to zoom · drag to pan · click to open

Discussion

Sign in to join the discussion

No comments yet — be the first to share your thoughts!

More in Releases