An Improved Approximation Algorithm for the Matching Augmentation Problem
Data Structures and Algorithms
2020-12-14 v2 Discrete Mathematics
Abstract
We present a -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 -approximation algorithm for the same problem was presented recently, see Cheriyan, et al., "The matching augmentation problem: a -approximation algorithm," {\em 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.
Cite
@article{arxiv.2007.11559,
title = {An Improved Approximation Algorithm for the Matching Augmentation Problem},
author = {J. Cheriyan and R. Cummings and J. Dippel and J. Zhu},
journal= {arXiv preprint arXiv:2007.11559},
year = {2020}
}
Comments
30 pages, 6 figures