Approximating maximum acyclic matchings by greedy and local search strategies
From MaRDI portal
Publication:2019502
DOI10.1007/978-3-030-58150-3_44OpenAlexW3082173007MaRDI QIDQ2019502
Maximilian Fürst, Dieter Rautenbach, Julien Baste
Publication date: 21 April 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-58150-3_44
Related Items (2)
On the parameterized complexity of the acyclic matching problem ⋮ Acyclic matching in some subclasses of graphs
Cites Work
- Unnamed Item
- Induced matchings in subcubic graphs without short cycles
- Two greedy consequences for maximum induced matchings
- Approximability results for the maximum and minimum maximal induced matching problems
- NP-completeness of some generalizations of the maximum matching problem
- A lower bound on the acyclic matching number of subcubic graphs
- Locally searching for large induced matchings
- Degenerate matchings and edge colorings
- Approximating weighted induced matchings
- Finding maximum induced matchings in subclasses of claw-free and \(P_5\)-free graphs, and in graphs with matching and induced matching of equal maximum size
- On the approximability of the maximum induced matching problem
- Generalized subgraph-restricted matchings in graphs
- Linear programming based approximation for unweighted induced matchings -- breaking the \(\varDelta\) barrier
- On some hard and some tractable cases of the maximum acyclic matching problem
- Uniquely restricted matchings in subcubic graphs
- The graphs with maximum induced matching and maximum matching the same size
- Induced Matchings in Graphs of Bounded Maximum Degree
- ACYCLIC MATCHINGS IN SUBCLASSES OF BIPARTITE GRAPHS
- Induced Matchings in Subcubic Graphs
- Induced Matchings in Graphs of Degree at Most 4
- Approximation and Online Algorithms
This page was built for publication: Approximating maximum acyclic matchings by greedy and local search strategies
