Pages that link to "Item:Q6487431"
From MaRDI portal
The following pages link to Computing fair and bottleneck matchings in geometric graphs (Q6487431):
Displaying 8 items.
- New variants of perfect non-crossing matchings (Q831710) (← links)
- Approximating the bottleneck plane perfect matching of a point set (Q904112) (← links)
- Cache-oblivious selection in sorted \(X+Y\) matrices (Q975535) (← links)
- Solving the Euclidean bottleneck matching problem by \(k\)-relative neighborhood graphs (Q1194341) (← links)
- Computing Euclidean bottleneck matchings in higher dimensions (Q1607062) (← links)
- Many-to-One Stable Matching: Geometry and Fairness (Q5387998) (← links)
- Geometry helps in bottleneck matching and related problems (Q5946120) (← links)
- New variants of perfect non-crossing matchings (Q6180638) (← links)