Pages that link to "Item:Q3967061"
From MaRDI portal
The following pages link to Divide and Conquer Heuristics for Minimum Weighted Euclidean Matching (Q3967061):
Displayed 9 items.
- Optimal speeding up of parallel algorithms based upon the divide-and- conquer strategy (Q760204) (← links)
- A partitioning algorithm for minimum weighted Euclidean matching (Q794175) (← links)
- Recurrence relations based on minimization and maximization (Q1079343) (← links)
- On the Euclidean assignment problem (Q1108932) (← links)
- Heuristic methods and applications: A categorized survey (Q1823879) (← links)
- Approximate minimum weight matching on points in k-dimensional space (Q1825658) (← links)
- Asymptotics of Mahler recurrences: The cyclotomic case (Q1919149) (← links)
- A survey of heuristics for the weighted matching problem (Q3315292) (← links)
- AN EFFICIENT PARALLEL ALGORITHM FOR THE ASSIGNMENT PROBLEM ON THE PLANE∗ (Q4820048) (← links)