Tight Approximation Ratio for Minimum Maximal Matching

11/20/2018
by   Szymon Dudycz, et al.
0

We study a combinatorial problem called Minimum Maximal Matching, where we are asked to find in a general graph the smallest that can not be extended. We show that this problem is hard to approximate with a constant smaller than 2, assuming the Unique Games Conjecture. As a corollary we show, that Minimum Maximal Matching in bipartite graphs is hard to approximate with constant smaller than 4/3, with the same assumption. With a stronger variant of the Unique Games Conjecture --- that is Small Set Expansion Hypothesis --- we are able to improve the hardness result up to the factor of 3/2.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/12/2019

The Projection Games Conjecture and the Hardness of Approximation of SSAT and related problems

The Super-SAT or SSAT problem was introduced by Dinur, Kindler, Raz and ...
research
05/18/2020

Approximation Algorithms and Hardness for Strong Unique Games

The UNIQUE GAMES problem is a central problem in algorithms and complexi...
research
06/20/2022

On approximating the rank of graph divisors

Baker and Norine initiated the study of graph divisors as a graph-theore...
research
07/21/2021

Approximation by Lexicographically Maximal Solutions in Matching and Matroid Intersection Problems

We study how good a lexicographically maximal solution is in the weighte...
research
07/20/2017

Inapproximability of the Standard Pebble Game and Hard to Pebble Graphs

Pebble games are single-player games on DAGs involving placing and movin...
research
10/04/2020

Inapproximability for Local Correlation Clustering and Dissimilarity Hierarchical Clustering

We present hardness of approximation results for Correlation Clustering ...
research
01/12/2022

A Characterization of Approximability for Biased CSPs

A μ-biased Max-CSP instance with predicate ψ:{0,1}^r →{0,1} is an instan...

Please sign up or login with your details

Forgot password? Click here to reset