Pages that link to "Item:Q794175"
From MaRDI portal
The following pages link to A partitioning algorithm for minimum weighted Euclidean matching (Q794175):
Displaying 9 items.
- Partitioning heuristics for two geometric maximization problems (Q800827) (← links)
- A lower bound to the complexity of Euclidean and rectilinear matching algorithms (Q1072708) (← links)
- On the Euclidean assignment problem (Q1108932) (← links)
- Quantizers ad the worst case Euclidean traveling salesman problem (Q1111946) (← links)
- Heuristic methods and applications: A categorized survey (Q1823879) (← links)
- Smoothed analysis of partitioning algorithms for Euclidean functionals (Q1950395) (← links)
- Minimum-error classes for matching parts (Q2661599) (← links)
- A survey of heuristics for the weighted matching problem (Q3315292) (← links)
- On the weighted Euclidean matching problem in R<sup>d</sup> (Q4548943) (← links)