A lower bound for computing geometric spanners

DOI10.1016/J.COMGEO.2015.12.004MaRDI QIDQ265718zbMATH OpenOpenAlexFDO

Authors Mohammad Farshi, Abolfazl Poureidi

Publication date 12 April 2016

Published in Computational Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.comgeo.2015.12.004

zbMATH Keywords

geometric networklower boundspannerSteiner spanner

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Recommendations

• Lower bounds for computing geometric spanners and approximate shortest paths
• On Spanners of Geometric Graphs
• Geometric Spanner of Segments
• On Spanners of Geometric Graphs
• Fast Greedy Algorithms for Constructing Sparse Geometric Spanners

Cites work

• Geometric Spanner Networks
• scientific article; zbMATH DE number 43279 (Why is no real title available?)
• scientific article; zbMATH DE number 1220053 (Why is no real title available?)
• Lower bounds for computing geometric spanners and approximate shortest paths

Cited in

(8)

• Fractal dimension and lower bounds for geometric problems
• On plane geometric spanners: a survey and open problems
• EFFICIENT CONSTRUCTION OF LOW WEIGHTED BOUNDED DEGREE PLANAR SPANNER
• Lower bounds in on-line geometric searching metric searching
• Lower bounds in on-line geometric searching
• Lower bounds for computing geometric spanners and approximate shortest paths
• A unified framework for light spanners
• A unified framework of light spanners. I: Fast (yet optimal) constructions

This page was built for publication: A lower bound for computing geometric spanners

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