UWSpace is currently experiencing technical difficulties resulting from its recent migration to a new version of its software. These technical issues are not affecting the submission and browse features of the site. UWaterloo community members may continue submitting items to UWSpace. We apologize for the inconvenience, and are actively working to resolve these technical issues.
 

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

Thumbnail Image

Files

Dippel_Jack.pdf (652.37 KB)

Date

2019-05-23

Authors

Dippel, Jack

Journal Title

Journal ISSN

Volume Title

Publisher

University of Waterloo

Abstract

We present a 7/4 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. We first present a series of approximation guarantee preserving reductions, each of which can be performed in polytime. Performing these reductions gives us a restricted collection of MAP instances. We present a 7/4 approximation algorithm for this restricted set of MAP instances. The algorithm starts with a subgraph which is a min-cost 2-edge cover, contracts its blocks, adds paths to the subgraph to cover all its bridges, and finally adds cycles to the subgraph to connect all its components. We contract any blocks created throughout. The algorithm ends when the subgraph is a single vertex, and we output all the edges we’ve contracted which form a 2ECSS.

Description

Keywords

map, matching augmentation problem, approximation algorithm, 7/4

LC Keywords

Citation

URI

http://hdl.handle.net/10012/14700

Collections

Theses
Combinatorics and Optimization