Pages that link to "Item:Q2444761"

The following pages link to A note on searching line arrangements and applications (Q2444761):

Displaying 7 items.

• One-dimensional \(k\)-center on uncertain data (Q497686) (← links)
• Efficient algorithms for the one-dimensional \(k\)-center problem (Q500977) (← 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)
• Line-Constrained k-Median, k-Means, and k-Center Problems in the Plane (Q2988724) (← 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)