Pages that link to "Item:Q5133973"
From MaRDI portal
The following pages link to A Near-linear Time ε-Approximation Algorithm for Geometric Bipartite Matching (Q5133973):
Displaying 6 items.
- An 0(n log n) algorithm for the convex bipartite matching problem (Q792885) (← links)
- (Q2934580) (← 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)
- A near-linear time ε-approximation algorithm for geometric bipartite matching (Q5415489) (← links)
- Dynamic Euclidean bottleneck matching (Q6612538) (← links)