Optimal slope selection via expanders
From MaRDI portal
Publication:689630
DOI10.1016/0020-0190(93)90234-ZzbMATH Open0797.68155DBLPjournals/ipl/KatzS93OpenAlexW2050420176WikidataQ56607630 ScholiaQ56607630MaRDI QIDQ689630FDOQ689630
Authors: Matthew J. Katz, Micha Sharir 
Publication date: 15 November 1993
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(93)90234-z
Recommendations
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Ramanujan graphs
- Applying Parallel Computation Algorithms in the Design of Serial Algorithms
- Randomized optimal algorithm for slope selection
- Slowing down sorting networks to obtain faster sorting algorithms
- A RANDOMIZED ALGORITHM FOR SLOPE SELECTION
- Sorting in \(c \log n\) parallel steps
- Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators
- An Optimal-Time Algorithm for Slope Selection
- Cutting hyperplane arrangements
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
- An Expander-Based Approach to Geometric Optimization
- One-dimensional \(k\)-center on uncertain data
- 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)
