Minimum dilation stars
From MaRDI portal
Publication:871060
DOI10.1016/J.COMGEO.2006.05.007zbMATH Open1130.05023OpenAlexW3098722153MaRDI QIDQ871060FDOQ871060
Authors: David Eppstein, Kevin Wortman 
Publication date: 15 March 2007
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2006.05.007
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Distance in graphs (05C12) Discrete location and assignment (90B80)
Cites Work
- Efficient randomized algorithms for some geometric optimization problems
- An O(n log n) algorithm for the all-nearest-neighbors problem
- 2-point site Voronoi diagrams
- Title not available (Why is that?)
- Title not available (Why is that?)
- Approximating the Stretch Factor of Euclidean Graphs
- Title not available (Why is that?)
- Optimal Point Placement for Mesh Smoothing
Cited In (13)
- On the dilation spectrum of paths, cycles, and trees
- SINGLE-SOURCE DILATION-BOUNDED MINIMUM SPANNING TREES
- Optimal Algorithms for Geometric Centers and Depth
- Dilation-optimal edge deletion in polygonal cycles
- Most finite point sets in the plane have dilation \(>1\)
- Approximate weighted farthest neighbors and minimum dilation stars
- Eutactic star closest to a given star
- Testing Euclidean Spanners
- Computing geometric minimum-dilation graphs is NP-hard
- Optimal Embedding into Star Metrics
- Inhomogeneous minima of star bodies
- Approximate weighted farthest neighbors and minimum dilation stars
- Distribution-sensitive construction of the greedy spanner
This page was built for publication: Minimum dilation stars
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q871060)
