Pages that link to "Item:Q1607062"
From MaRDI portal
The following pages link to Computing Euclidean bottleneck matchings in higher dimensions (Q1607062):
Displaying 11 items.
- Approximating the bottleneck plane perfect matching of a point set (Q904112) (← links)
- Bottleneck flows in unit capacity networks (Q976109) (← links)
- Solving the Euclidean bottleneck matching problem by \(k\)-relative neighborhood graphs (Q1194341) (← links)
- Structural properties of bichromatic non-crossing matchings (Q2247147) (← links)
- Bottleneck matchings and Hamiltonian cycles in higher-order Gabriel graphs (Q2338215) (← links)
- Optimal point movement for covering circular regions (Q2354019) (← links)
- Faster bottleneck non-crossing matchings of points in convex position (Q2401333) (← links)
- (Q3128895) (← links)
- An Optimal Matching Problem for the Euclidean Distance (Q5415058) (← links)
- Computing fair and bottleneck matchings in geometric graphs (Q6487431) (← links)
- Dynamic Euclidean bottleneck matching (Q6612538) (← links)