Pages that link to "Item:Q1149255"

The following pages link to Worst case bounds for the Euclidean matching problem (Q1149255):

Displaying 3 items.

• A partitioning algorithm for minimum weighted Euclidean matching (Q794175) (← 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)