An Improved Approximation Algorithm for the Matching Augmentation Problem

07/22/2020
by   J. Cheriyan, et al.
0

We present a 5/3-approximation algorithm for the matching augmentation problem (MAP): given a multi-graph with edges of cost either zero or one such that the edges of cost zero form a matching, find a 2-edge connected spanning subgraph (2-ECSS) of minimum cost. A 7/4-approximation algorithm for the same problem was presented recently, see Cheriyan, et al., "The matching augmentation problem: a 7/4-approximation algorithm," Math. Program., 182(1):315–354, 2020; arXiv:1810.07816. Our improvement is based on new algorithmic techniques, and some of these may lead to advances on related problems.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

10/17/2018

The Matching Augmentation Problem: A 7/4-Approximation Algorithm

We present a 7/4 approximation algorithm for the matching augmentation p...
11/05/2018

Towards a Unified Theory of Sparsification for Matching Problems

In this paper, we present a construction of a `matching sparsifier', tha...
07/05/2018

Partitioning Vectors into Quadruples: Worst-Case Analysis of a Matching-Based Algorithm

Consider a problem where 4k given vectors need to be partitioned into k ...
10/25/2019

Improved Approximation for Maximum Edge Colouring Problem

The anti-Ramsey number, ar(G, H) is the minimum integer k such that in a...
04/29/2020

Planted Models for the Densest k-Subgraph Problem

Given an undirected graph G, the Densest k-subgraph problem (DkS) asks t...
03/22/2019

Efficient Algorithms for Geometric Partial Matching

Let A and B be two point sets in the plane of sizes r and n respectively...
12/20/2018

Temporal Matching

A link stream is a sequence of pairs of the form (t,{u,v}), where t∈ N r...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.