Tight Inapproximability of Minimum Maximal Matching on Bipartite Graphs and Related Problems.
Szymon DudyczPasin ManurangsiJan MarcinkowskiPublished in: WAOA (2021)
Keyphrases
- related problems
- bipartite graph
- maximum matching
- maximum cardinality
- bipartite graph matching
- maximum weight
- stable set
- minimum weight
- link prediction
- stable marriage
- lower bound
- range searching
- approximation algorithms
- matching algorithm
- broadly applicable
- keypoints
- upper bound
- minimum cost
- minimum distance
- graph matching
- worst case
- active learning
- graph clustering
- image matching
- query processing