Pages that link to "Item:Q4601942"
From MaRDI portal
The following pages link to Slowing down sorting networks to obtain faster sorting algorithms (Q4601942):
Displaying 15 items.
- An O(n log n)-Time Algorithm for the k-Center Problem in Trees (Q5116532) (← links)
- LOCATING AN OBNOXIOUS LINE AMONG PLANAR OBJECTS (Q5300001) (← links)
- Optimal Movement of Mobile Sensors for Barrier Coverage of a Planar Region (Q5505648) (← links)
- An $O(n\log n)$-Time Algorithm for the $k$-Center Problem in Trees (Q5858648) (← links)
- Optimal Algorithms for Geometric Centers and Depth (Q5864667) (← links)
- Covering convex polygons by two congruent disks (Q5918557) (← links)
- Intersecting disks using two congruent disks (Q5918623) (← links)
- Covering uncertain points in a tree (Q5920112) (← links)
- Intersecting disks using two congruent disks (Q5925580) (← links)
- The \(k\)-centrum multi-facility location problem (Q5931794) (← links)
- Guarding a terrain by two watchtowers (Q5961974) (← links)
- Covering convex polygons by two congruent disks (Q5970791) (← links)
- Discrete Fréchet distance for closed curves (Q6101836) (← links)
- Minmax centered \(k\)-partitioning of trees and applications to sink evacuation with dynamic confluent flows (Q6107888) (← links)
- Dispersing facilities on planar segment and circle amidst repulsion (Q6112004) (← links)
