Pages that link to "Item:Q497686"
From MaRDI portal
The following pages link to One-dimensional \(k\)-center on uncertain data (Q497686):
Displaying 11 items.
- A note on computing the center of uncertain data on the real line (Q1790197) (← links)
- Computing \(k\)-centers of uncertain points on a real line (Q2157899) (← links)
- The two-center problem of uncertain points on a real line (Q2687919) (← links)
- The \(p\)-center problem under locational uncertainty of demand points (Q2688470) (← links)
- Computing the Rectilinear Center of Uncertain Points in the Plane (Q4557735) (← links)
- r-Gatherings on a star and uncertain r-gatherings on a line (Q5101887) (← links)
- An O(n log n)-Time Algorithm for the k-Center Problem in Trees (Q5116532) (← links)
- An $O(n\log n)$-Time Algorithm for the $k$-Center Problem in Trees (Q5858648) (← links)
- Clustering Geometrically-Modeled Points in the Aggregated Uncertainty Model (Q5862343) (← links)
- Covering uncertain points in a tree (Q5920112) (← links)
- Clustering with faulty centers (Q6092308) (← links)