Tight inapproximability of minimum maximal matching on bipartite graphs and related problems (Q2085735)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Tight inapproximability of minimum maximal matching on bipartite graphs and related problems |
scientific article |
Statements
Tight inapproximability of minimum maximal matching on bipartite graphs and related problems (English)
0 references
19 October 2022
0 references
matching
0 references
hardness of approximation
0 references
