Minimizing the diameter of a spanning tree for imprecise points
From MaRDI portal
Publication:1709600
DOI10.1007/S00453-017-0292-6zbMATH Open1390.68722OpenAlexW2912516824MaRDI QIDQ1709600FDOQ1709600
Authors: Chih-Hung Liu, Sandro Montanari 
Publication date: 6 April 2018
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-017-0292-6
Recommendations
- Minimizing the diameter of a spanning tree for imprecise points
- Minimum Diameter Spanning Trees and Related Problems
- Largest bounding box, smallest diameter, and related problems on imprecise points
- Approximate minimum diameter
- A fully polynomial time approximation scheme for the smallest diameter of imprecise points
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- Title not available (Why is that?)
- Concrete and abstract Voronoi diagrams
- Applications of random sampling in computational geometry. II
- Voronoi diagrams and Delaunay triangulations
- FURTHEST SITE ABSTRACT VORONOI DIAGRAMS
- The Clarkson–Shor Technique Revisited and Extended
- Farthest-polygon Voronoi diagrams
- A linear-time algorithm for computing the Voronoi diagram of a convex polygon
- Maintenance of configurations in the plane
- Constructing strongly convex approximate hulls with inaccurate primitives
- Minimum Diameter Spanning Trees and Related Problems
- Title not available (Why is that?)
- Systems of distant representatives
- Largest and smallest convex hulls for imprecise points
- Preprocessing Imprecise Points and Splitting Triangulations
- Facility location and the geometric minimum-diameter spanning tree.
- Computing a \((1+\varepsilon)\)-approximate geometric minimum-diameter spanning tree
- Semi-Online Maintenance of Geometric Optima and Measures
- An Optimal Algorithm for the Intersection Radius of a Set of Convex Polygons
- Largest bounding box, smallest diameter, and related problems on imprecise points
- Delaunay triangulation of imprecise points in linear time after preprocessing
- Title not available (Why is that?)
- Preprocessing imprecise points for Delaunay triangulation: simplified and extended
- Title not available (Why is that?)
- On minimum-and maximum-weight minimum spanning trees with neighborhoods
- Rectilinear shortest path and rectilinear minimum spanning tree with neighborhoods
- Convex hull of points lying on lines in \(O(n\log n)\) time after preprocessing
- Unions of onions: preprocessing imprecise points for fast onion decomposition
- Minimizing the diameter of a spanning tree for imprecise points
Cited In (4)
This page was built for publication: Minimizing the diameter of a spanning tree for imprecise points
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1709600)
