Optimal slope selection via expanders
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4032498 (Why is no real title available?)
- scientific article; zbMATH DE number 53883 (Why is no real title available?)
- A RANDOMIZED ALGORITHM FOR SLOPE SELECTION
- An Optimal-Time Algorithm for Slope Selection
- Applying Parallel Computation Algorithms in the Design of Serial Algorithms
- Cutting hyperplane arrangements
- Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators
- Ramanujan graphs
- Randomized optimal algorithm for slope selection
- Slowing down sorting networks to obtain faster sorting algorithms
- Sorting in \(c \log n\) parallel steps
Cited in
(16)- Selecting distances in arrangements of hyperplanes spanned by points.
- Efficient algorithms for the one-dimensional \(k\)-center problem
- A note on searching line arrangements and applications
- Efficient randomized algorithms for some geometric optimization problems
- Efficient randomized algorithms for robust estimation of circular arcs and aligned ellipses
- Efficient algorithms for maximum regression depth
- Continuous location of dimensional structures.
- Line-Constrained k-Median, k-Means, and k-Center Problems in the Plane
- An \(O(n\log n)\)-time algorithm for the \(k\)-center problem in trees
- Arrangements in higher dimensions: Voronoi diagrams, motion planning, and other applications
- Computing balanced convex partitions of lines
- One-dimensional \(k\)-center on uncertain data
- An Expander-Based Approach to Geometric Optimization
- An \(O(n\log n)\)-time algorithm for the \(k\)-center problem in trees
- Counting and representing intersections among triangles in three dimensions
- Optimal slope selection via cuttings
This page was built for publication: Optimal slope selection via expanders
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q689630)
