Approximating the Stretch Factor of Euclidean Graphs

DOI10.1137/S0097539799361671MaRDI QIDQ4507380zbMATH OpenOpenAlexFDO

Authors Giri Narasimhan, Michiel Smid

Publication date 18 October 2000

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0097539799361671

zbMATH Keywords

approximate shortest pathscomputational geometryspannerswell-separated pairs

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Approximating the average stretch factor of geometric graphs
• Approximating the average stretch factor of geometric graphs
• On the stretch factor of convex Delaunay graphs
• On the Stretch Factor of Convex Delaunay Graphs
• scientific article; zbMATH DE number 4070353
• Computing the stretch of an embedded graph
• Stretch and diameter in random geometric graphs
• On the stretch factor of randomly embedded random graphs
• Towards tight approximation bounds for graph diameter and eccentricities
• Toward Tight Approximation Bounds for Graph Diameter and Eccentricities

Cited in

(30)

• A fast algorithm for approximating the detour of a polygonal chain.
• Computing the detour and spanning ratio of paths, trees, and cycles in 2D and 3D
• A PTAS for minimum vertex dilation triangulation of a simple polygon with a constant number of sources of dilation
• Deformable spanners and applications
• Approximating the average stretch factor of geometric graphs
• Approximating the average stretch factor of geometric graphs
• scientific article; zbMATH DE number 1809600 (Why is no real title available?)
• Connect the Dot: Computing Feed-Links with Minimum Dilation
• Improving the Stretch Factor of a Geometric Network by Edge Augmentation
• scientific article; zbMATH DE number 17663 (Why is no real title available?)
• Computing the stretch factor and maximum detour of paths, trees, and cycles in the normed space
• Linear time algorithm for optimal feed-link placement
• Testing Euclidean Spanners
• On the stretch factor of polygonal chains
• On the stretch factor of polygonal chains
• Local construction and coloring of spanners of location aware unit disk graphs
• Distribution-sensitive construction of the greedy spanner
• Local Construction and Coloring of Spanners of Location Aware Unit Disk Graphs
• Dilation-optimal edge deletion in polygonal cycles
• Dilation-Optimal Edge Deletion in Polygonal Cycles
• Many distances in planar graphs
• Spanners in randomly weighted graphs: Euclidean case
• Almost all Delaunay triangulations have stretch factor greater than \(\pi /2\)
• Bounded-degree plane geometric spanners in practice
• Engineering an algorithm for constructing low-stretch geometric graphs with near-greedy average degrees
• Exact algorithms for minimum dilation triangulation
• Algorithms for graphs of bounded treewidth via orthogonal range searching
• On the dilation spectrum of paths, cycles, and trees
• Minimum dilation stars
• Thresholding random geometric graph properties motivated by ad hoc sensor networks

This page was built for publication: Approximating the Stretch Factor of Euclidean Graphs

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