Pages that link to "Item:Q1825658"
From MaRDI portal
The following pages link to Approximate minimum weight matching on points in k-dimensional space (Q1825658):
Displaying 6 items.
- A generalized hypergreedy algorithm for weighted perfect matching (Q688623) (← links)
- Fast geometric approximation techniques and geometric embedding problems (Q1202926) (← links)
- A sparse graph almost as good as the complete graph on points in \(k\) dimensions (Q1814131) (← links)
- Approximation algorithms for lawn mowing and milling (Q1841242) (← links)
- The Euclidean <i>k</i>-Supplier Problem (Q5108254) (← links)
- Maximum bipartite matchings with low rank data: locality and perturbation analysis (Q5964024) (← links)
