Pages that link to "Item:Q839627"
From MaRDI portal
The following pages link to A randomized algorithm for online unit clustering (Q839627):
Displaying 16 items.
- Better bounds on online unit clustering (Q388452) (← links)
- An online 2-dimensional clustering problem with variable sized clusters (Q402248) (← links)
- An improved lower bound for one-dimensional online unit clustering (Q496022) (← links)
- A competitive strategy for distance-aware online shape allocation (Q744054) (← links)
- Online unit clustering: Variations on a theme (Q954982) (← links)
- An improved algorithm for online unit clustering (Q1040649) (← links)
- Online unit clustering in higher dimensions (Q1644944) (← links)
- Online clustering with variable sized clusters (Q1939661) (← links)
- Online unit clustering and unit covering in higher dimensions (Q2134741) (← links)
- A new model for the linear 1-dimensional online clustering problem (Q2254541) (← links)
- Online coloring a token graph (Q2303438) (← links)
- Online sum-radii clustering (Q2453160) (← links)
- A Randomized Algorithm for Online Unit Clustering (Q5443514) (← links)
- Online unit covering in Euclidean space (Q5919348) (← links)
- Online class cover problem (Q6600810) (← links)
- Online geometric covering and piercing (Q6614105) (← links)