Pages that link to "Item:Q4548943"
From MaRDI portal
The following pages link to On the weighted Euclidean matching problem in R<sup>d</sup> (Q4548943):
Displaying 7 items.
- A partitioning algorithm for minimum weighted Euclidean matching (Q794175) (← links)
- Partitioning heuristics for two geometric maximization problems (Q800827) (← links)
- A lower bound to the complexity of Euclidean and rectilinear matching algorithms (Q1072708) (← links)
- The Euclidean \(k\)-supplier problem in \(\mathbb R^2\) (Q1629944) (← links)
- Smoothed analysis of partitioning algorithms for Euclidean functionals (Q1950395) (← links)
- Inexpensive <i>d</i>‐dimensional matchings (Q4534217) (← links)
- An Optimal Matching Problem for the Euclidean Distance (Q5415058) (← links)