Pages that link to "Item:Q1072708"
From MaRDI portal
The following pages link to A lower bound to the complexity of Euclidean and rectilinear matching algorithms (Q1072708):
Displaying 4 items.
- A generalized hypergreedy algorithm for weighted perfect matching (Q688623) (← links)
- On the existence of weak greedy matching heuristics (Q1080871) (← links)
- New primal and dual matching heuristics (Q1891231) (← links)
- AN EFFICIENT PARALLEL ALGORITHM FOR THE ASSIGNMENT PROBLEM ON THE PLANE∗ (Q4820048) (← links)
