Pages that link to "Item:Q294775"
From MaRDI portal
The following pages link to A lower bound for approximating the geometric minimum weight matching (Q294775):
Displaying 5 items.
- An efficient parallel algorithm for finding minimum weight matching for points on a convex polygon (Q750155) (← links)
- A lower bound to the complexity of Euclidean and rectilinear matching algorithms (Q1072708) (← links)
- Approximate minimum weight matching on points in k-dimensional space (Q1825658) (← links)
- Fast Matching Algorithms for Points on a Polygon (Q3978776) (← links)
- Inexpensive <i>d</i>‐dimensional matchings (Q4534217) (← links)