Pages that link to "Item:Q1388130"
From MaRDI portal
The following pages link to Optimal slope selection via cuttings (Q1388130):
Displaying 18 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)
- Extremal problems on triangle areas in two and three dimensions (Q1040833) (← links)
- Randomized optimal algorithm for slope selection (Q1182097) (← links)
- Efficient randomized algorithms for some geometric optimization problems (Q1816458) (← links)
- Efficient algorithms for the sum selection problem and \(k\) maximum sums problem (Q2268857) (← links)
- A note on searching line arrangements and applications (Q2444761) (← links)
- Proximity problems on line segments spanned by points (Q2489537) (← 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)
- Optimal slope selection (Q3795242) (← links)
- An Optimal-Time Algorithm for Slope Selection (Q3835020) (← 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)
