Pages that link to "Item:Q5415489"
From MaRDI portal
The following pages link to A near-linear time ε-approximation algorithm for geometric bipartite matching (Q5415489):
Displaying 16 items.
- An 0(n log n) algorithm for the convex bipartite matching problem (Q792885) (← links)
- A unified framework for clustering constrained data without locality property (Q2300724) (← links)
- (Q2934580) (← links)
- Linear-Time Approximation for Maximum Weight Matching (Q3189636) (← links)
- On Geometric Prototype and Applications (Q5009580) (← links)
- (Q5088931) (← links)
- Preconditioning for the Geometric Transportation Problem (Q5088942) (← links)
- (Q5088980) (← links)
- (Q5091017) (← links)
- A Near-linear Time ε-Approximation Algorithm for Geometric Bipartite Matching (Q5133973) (← links)
- A sub-quadratic algorithm for bipartite matching of planar points with bounded integer coordinates (Q5174455) (← links)
- Near Linear Time Approximation Schemes for Uncapacitated and Capacitated b–Matching Problems in Nonbipartite Graphs (Q5383977) (← links)
- (Q5875463) (← links)
- Improved PTASs for convex barrier coverage (Q5896869) (← links)
- Maximum bipartite matchings with low rank data: locality and perturbation analysis (Q5964024) (← links)
- A data-dependent approach for high-dimensional (robust) Wasserstein alignment (Q6579774) (← links)