Computing Geometric Minimum-Dilation Graphs Is NP-Hard

DOI10.1007/978-3-540-70904-6_20MaRDI QIDQ3595495zbMATH OpenOpenAlexFDO

Authors Rolf Klein, Martin Kuetz

Publication date 28 August 2007

Published in Graph Drawing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-70904-6_20

zbMATH Keywords

dilationgeometric networkNP-hardnessplane graphstretch factorspanning ratio

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12)

Recommendations

• Computing geometric minimum-dilation graphs is NP-hard
• Computing a minimum-dilation spanning tree is NP-hard
• Computing minimum dilation spanning trees in geometric graphs
• The geometric dilation of finite point sets
• Algorithms and Computation

Cited in

(12)

• Routing among convex polygonal obstacles in the plane
• Sparse geometric graphs with small dilation
• Computing geometric minimum-dilation graphs is NP-hard
• On the dilation spectrum of paths, cycles, and trees
• Optimal Embedding into Star Metrics
• Hardness results for computing optimal locally Gabriel graphs
• Computing minimum dilation spanning trees in geometric graphs
• Minimum weight Euclidean \(t\)-spanner is NP-hard
• On plane geometric spanners: a survey and open problems
• Dilation-optimal edge deletion in polygonal cycles
• Computing a minimum-dilation spanning tree is NP-hard
• Optimal spanners for axis-aligned rectangles

This page was built for publication: Computing Geometric Minimum-Dilation Graphs Is NP-Hard

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3595495)