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 10 items.
- A lower bound for approximating the geometric minimum weight matching (Q294775) (← links)
- 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)
- (Q2934580) (← links)
- (Q3128895) (← links)
- On the weighted Euclidean matching problem in R<sup>d</sup> (Q4548943) (← links)
- AN EFFICIENT PARALLEL ALGORITHM FOR THE ASSIGNMENT PROBLEM ON THE PLANE∗ (Q4820048) (← links)
- Lower bounds in on-line geometric searching metric searching (Q5055955) (← links)
- Lower bounds in on-line geometric searching (Q5931368) (← links)