Local Search for Weighted Tree Augmentation and Steiner Tree

07/15/2021
by   Vera Traub, et al.
0

We present a technique that allows for improving on some relative greedy procedures by well-chosen (non-oblivious) local search algorithms. Relative greedy procedures are a particular type of greedy algorithm that start with a simple, though weak, solution, and iteratively replace parts of this starting solution by stronger components. Some well-known applications of relative greedy algorithms include approximation algorithms for Steiner Tree and, more recently, for connectivity augmentation problems. The main application of our technique leads to a (1.5+ϵ)-approximation for Weighted Tree Augmentation, improving on a recent relative greedy based method with approximation factor 1+ln 2 + ϵ≈ 1.69. Furthermore, we show how our local search technique can be applied to Steiner Tree, leading to an alternative way to obtain the currently best known approximation factor of ln 4 + ϵ. Contrary to prior methods, our approach is purely combinatorial without the need to solve an LP. Nevertheless, the solution value can still be bounded in terms of the well-known hypergraphic LP, leading to an alternative, and arguably simpler, technique to bound its integrality gap by ln 4.

READ FULL TEXT

page 1

page 5

page 9

page 11

page 12

page 13

page 15

page 16

research
04/14/2021

A Better-Than-2 Approximation for Weighted Tree Augmentation

We present an approximation algorithm for Weighted Tree Augmentation wit...
research
04/14/2022

Better-Than-4/3-Approximations for Leaf-to-Leaf Tree and Connectivity Augmentation

The Connectivity Augmentation Problem (CAP) together with a well-known s...
research
11/02/2018

Local search breaks 1.75 for Graph Balancing

Graph Balancing is the problem of orienting the edges of a weighted mult...
research
11/07/2022

A Simple Combinatorial Algorithm for Robust Matroid Center

Recent progress on robust clustering led to constant-factor approximatio...
research
09/16/2022

A (1.5+ε)-Approximation Algorithm for Weighted Connectivity Augmentation

Connectivity augmentation problems are among the most elementary questio...
research
04/06/2018

Improved Approximation for Tree Augmentation: Saving by Rewiring

The Tree Augmentation Problem (TAP) is a fundamental network design prob...
research
10/30/2021

On Small-Depth Tree Augmentations

We study the Weighted Tree Augmentation Problem for general link costs. ...

Please sign up or login with your details

Forgot password? Click here to reset