Pages that link to "Item:Q2085735"
From MaRDI portal
The following pages link to Tight inapproximability of minimum maximal matching on bipartite graphs and related problems (Q2085735):
Displaying 5 items.
- Almost sure convergence of the minimum bipartite matching functional in Euclidean space (Q1410406) (← links)
- Minimum transversals of maximum matchings as approximate solutions to the bisection problem (Q1913329) (← links)
- Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut (Q3020016) (← links)
- A Faster Algorithm for Minimum-Cost Bipartite Matching in Minor-Free Graphs (Q5236217) (← links)
- Near Linear Time Approximation Schemes for Uncapacitated and Capacitated b–Matching Problems in Nonbipartite Graphs (Q5383977) (← links)