Pages that link to "Item:Q3978776"
From MaRDI portal
The following pages link to Fast Matching Algorithms for Points on a Polygon (Q3978776):
Displaying 12 items.
- An algorithm to find polygon similarity (Q582069) (← links)
- A generalized hypergreedy algorithm for weighted perfect matching (Q688623) (← links)
- An efficient parallel algorithm for finding minimum weight matching for points on a convex polygon (Q750155) (← links)
- New variants of perfect non-crossing matchings (Q831710) (← links)
- A maximum \(b\)-matching problem arising from median location models with applications to the roommates problem (Q1380926) (← links)
- Perspectives of Monge properties in optimization (Q1923588) (← links)
- Minimum cost \(b\)-matching problems with neighborhoods (Q2082547) (← links)
- Efficient many-to-Many point matching in one dimension (Q2373930) (← links)
- Faster strongly polynomial algorithms for the unbalanced transportation problem and assignment problem with Monge costs (Q2811304) (← links)
- An <i>EP</i> Algorithm for Computing a Minimum Weight Perfect Matching for a Set of Points on the Plane (Q4319328) (← links)
- New variants of perfect non-crossing matchings (Q6180638) (← links)
- Dynamic Euclidean bottleneck matching (Q6612538) (← links)