Parameterized inapproximability of Morse matching

09/09/2021
by   Ulrich Bauer, et al.
0

We study the problem of minimizing the number of critical simplices from the point of view of inapproximability and parameterized complexity. We first show inapproximability of Min-Morse Matching within a factor of 2^log^(1-ϵ)n. Our second result shows that Min-Morse Matching is W[P]-hard with respect to the standard parameter. Next, we show that Min-Morse Matching with standard parameterization has no FPT approximation algorithm for any approximation factor ρ. The above hardness results are applicable to complexes of dimension ≥ 2. On the positive side, we provide a factor O(n/log n) approximation algorithm for Min-Morse Matching on 2-complexes, noting that no such algorithm is known for higher dimensional complexes. Finally, we devise discrete gradients with very few critical simplices for typical instances drawn from a fairly wide range of parameter values of the Costa-Farber model of random complexes.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 11

page 12

01/25/2018

Hardness of Approximation for Morse Matching

We consider the approximability of maximization and minimization variant...
10/17/2018

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

We present a 7/4 approximation algorithm for the matching augmentation p...
10/16/2019

Maximum-Size Envy-free Matchings

We consider the problem of assigning residents to hospitals when hospita...
04/17/2020

On Regularity of Max-CSPs and Min-CSPs

We study approximability of regular constraint satisfaction problems, i....
11/13/2015

On Choosing Committees Based on Approval Votes in the Presence of Outliers

We study the computational complexity of committee selection problem for...
06/03/2021

Approximation Algorithms for Min-Distance Problems in DAGs

The min-distance between two nodes u, v is defined as the minimum of the...
11/15/2020

Recoverable, Abortable, and Adaptive Mutual Exclusion with Sublogarithmic RMR Complexity

We present the first recoverable mutual exclusion (RME) algorithm that i...
This week in AI

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