Pages that link to "Item:Q3969884"
From MaRDI portal
The following pages link to Probabilistic analysis of divide‐and‐conquer heuristics for minimum weighted euclidean matching (Q3969884):
Displaying 6 items.
- Mellin transforms and asymptotics: Harmonic sums (Q672981) (← links)
- A partitioning algorithm for minimum weighted Euclidean matching (Q794175) (← links)
- Heuristic methods and applications: A categorized survey (Q1823879) (← links)
- Linear-Time Approximation for Maximum Weight Matching (Q3189636) (← links)
- Probabilistic Analysis of a Greedy Heuristic for Euclidean Matching (Q3415878) (← links)
- AN EFFICIENT PARALLEL ALGORITHM FOR THE ASSIGNMENT PROBLEM ON THE PLANE∗ (Q4820048) (← links)
