Minimizing the diameter of a spanning tree for imprecise points

DOI10.1007/978-3-662-48971-0_33MaRDI QIDQ3459877zbMATH OpenOpenAlexFDO

Authors Chih-Hung Liu, Sandro Montanari

Publication date 11 January 2016

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-48971-0_33

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

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
• Computing a (1+)-approximate geometric minimum-diameter spanning tree
• A fully polynomial time approximation scheme for the smallest diameter of imprecise points

Cited in

(4)

• Minimizing the diameter of a spanning tree for imprecise points
• A fully polynomial time approximation scheme for the smallest diameter of imprecise points
• Euclidean Distance Matrix Completion and Point Configurations from the Minimal Spanning Tree
• Piercing diametral disks induced by edges of maximum spanning trees

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 Q3459877)