Hardness of Approximation for Morse Matching

01/25/2018
by   Ulrich Bauer, et al.
0

We consider the approximability of maximization and minimization variants of the Morse matching problem, posed as open problems by Joswig and Pfetsch. We establish hardness results for Max-Morse matching and Min-Morse matching. In particular, we show that, for a simplicial complex with n simplices and dimension d ≤ 3, it is NP-hard to approximate Min-Morse matching within a factor of O(n^1-ϵ), for any ϵ > 0. Moreover, using an L-reduction from Degree 3 Max-Acyclic Subgraph to Max-Morse matching, we show that it is both NP-hard and UGC-hard to approximate Max-Morse matching for simplicial complexes of dimension d ≤ 2 within certain explicit constant factors.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/06/2020

Maximum Matchings and Popularity

Let G be a bipartite graph where every node has a strict ranking of its ...
research
09/09/2021

Parameterized inapproximability of Morse matching

We study the problem of minimizing the number of critical simplices from...
research
01/25/2022

An Efficient Algorithm for the Partitioning Min-Max Weighted Matching Problem

The Partitioning Min-Max Weighted Matching (PMMWM) problem is an NP-hard...
research
06/05/2023

Solving NP-hard Min-max Routing Problems as Sequential Generation with Equity Context

Min-max routing problems aim to minimize the maximum tour length among a...
research
12/05/2020

r-Gathering Problems on Spiders:Hardness, FPT Algorithms, and PTASes

We consider the min-max r-gathering problem described as follows: We are...
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...
research
04/29/2022

NP-hardness of computing PL geometric category in dimension 2

The PL geometric category of a polyhedron P, denoted plgcat(P), provides...

Please sign up or login with your details

Forgot password? Click here to reset