Pages that link to "Item:Q689630"

The following pages link to Optimal slope selection via expanders (Q689630):

Displaying 16 items.

• One-dimensional \(k\)-center on uncertain data (Q497686) (← links)
• Efficient algorithms for the one-dimensional \(k\)-center problem (Q500977) (← links)
• Selecting distances in arrangements of hyperplanes spanned by points. (Q878011) (← links)
• Efficient algorithms for maximum regression depth (Q938312) (← links)
• Optimal slope selection via cuttings (Q1388130) (← links)
• Continuous location of dimensional structures. (Q1410321) (← links)
• Efficient randomized algorithms for some geometric optimization problems (Q1816458) (← links)
• Optimal point movement for covering circular regions (Q2354019) (← links)
• A note on searching line arrangements and applications (Q2444761) (← links)
• Counting and representing intersections among triangles in three dimensions (Q2571213) (← links)
• Line-Constrained k-Median, k-Means, and k-Center Problems in the Plane (Q2988724) (← links)
• Arrangements in higher dimensions: Voronoi diagrams, motion planning, and other applications (Q5057426) (← 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)
• Efficient randomized algorithms for robust estimation of circular arcs and aligned ellipses (Q5943320) (← links)
• Computing balanced convex partitions of lines (Q6174825) (← links)