Profile directory About Mobile apps
Log in Sign up
arXiv Math @arxiv_math@qoto.org
Follow

Two results towards the approximation of special maximum matchings in graphs https://arxiv.org/abs/2409.16324 #mathCO

Two results towards the approximation of special maximum matchings in graphs

For a graph $G$ define the parameters $\ell(G)$ and $L(G)$ as the minimum and maximum value of $ν(G\backslash F)$, where $F$ is a maximum matching of $G$ and $ν(G)$ is the number of edges in it. In this paper, we show that there is a small constant $c>0$, such that the following decision problem is NP-complete: given a graph $G$ and $k\leq \frac{|V|}{2}$, check whether there is a maximum matching $F$ in $G$, such that $|ν(G\backslash F)-k|\leq c\cdot |V|$. Note that when $c=1$, this problem is polynomial time solvable as we observe in the paper. Since in any graph $G$, we have $L(G)\leq 2\ell(G)$, any polynomial time algorithm constructing a maximum matching of a graph is a 2-approximation algorithm for $\ell(G)$ and $\frac{1}{2}$-approximation algorithm for $L(G)$. We complement these observations by presenting two inapproximability results for $\ell(G)$ and $L(G)$.

arxiv.org
September 27, 2024 at 3:10 AM · · feed2toot · 0 · 0 · 0
Sign in to participate in the conversation
Qoto Mastodon

QOTO: Question Others to Teach Ourselves
An inclusive, Academic Freedom, instance
All cultures welcome.
Hate speech and harassment strictly forbidden.

Trending now

#rebrandwebsitesortech0 people talking
0
#HashtagGames0 people talking
0

Resources

  • Terms of service
  • Privacy policy

Developers

  • Documentation
  • API

What is Mastodon?

qoto.org

  • About
  • v3.5.19-qoto

More…

  • Source code
  • Mobile apps
v3.5.19-qoto · Privacy policy