A Simple LP-Based Approximation Algorithm for the Matching Augmentation Problem

02/15/2022
by   Étienne Bamas, et al.
0

The Matching Augmentation Problem (MAP) has recently received significant attention as an important step towards better approximation algorithms for finding cheap 2-edge connected subgraphs. This has culminated in a 5/3-approximation algorithm. However, the algorithm and its analysis are fairly involved and do not compare against the problem's well-known LP relaxation called the cut LP. In this paper, we propose a simple algorithm that, guided by an optimal solution to the cut LP, first selects a DFS tree and then finds a solution to MAP by computing an optimum augmentation of this tree. Using properties of extreme point solutions, we show that our algorithm always returns (in polynomial time) a better than 2-approximation when compared to the cut LP. We thereby also obtain an improved upper bound on the integrality gap of this natural relaxation.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/17/2018

LP Relaxation and Tree Packing for Minimum k-cuts

Karger used spanning tree packings to derive a near linear-time randomiz...
research
10/30/2021

On Small-Depth Tree Augmentations

We study the Weighted Tree Augmentation Problem for general link costs. ...
research
11/22/2018

Approximate Multi-Matroid Intersection via Iterative Refinement

We introduce a new iterative rounding technique to round a point in a ma...
research
07/19/2018

A Tale of Santa Claus, Hypergraphs and Matroids

A well-known problem in scheduling and approximation algorithms is the S...
research
05/25/2020

Symmetric Linear Programming Formulations for Minimum Cut with Applications to TSP

We introduce multiple symmetric LP relaxations for minimum cut problems....
research
11/24/2018

Polynomial-time algorithms for 2-edge-connected subgraphs on fundamental classes by top-down coloring

Finding the exact integrality gap α for the LP relaxation of the 2-edge-...
research
10/26/2018

Virtual Network Embedding via Decomposable LP Formulations: Orientations of Small Extraction Width and Beyond

The Virtual Network Embedding Problem (VNEP) considers the efficient all...

Please sign up or login with your details

Forgot password? Click here to reset