scientific article; zbMATH DE number 1263225

zbMath0968.68533MaRDI QIDQ4234097

Sunil Arya, David M. Mount, Jeffrey S. Salowe, Gautam K. Das, Michiel H. M. Smid

Publication date: 28 August 2001

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items

Efficient construction of a bounded-degree spanner with low weight ⋮ Routing on heavy-path WSPD-spanners ⋮ Approximating geometric bottleneck shortest paths ⋮ Local Construction and Coloring of Spanners of Location Aware Unit Disk Graphs ⋮ On the Power of the Semi-Separated Pair Decomposition ⋮ Minimum power assignment in wireless ad hoc networks with spanner property ⋮ Truly Optimal Euclidean Spanners ⋮ Covering metric spaces by few trees ⋮ Ordered theta graphs ⋮ New Doubling Spanners: Better and Simpler ⋮ Local routing algorithms on Euclidean spanners with small diameter ⋮ Geometric Spanner of Objects under L 1 Distance ⋮ Vertex Fault-Tolerant Geometric Spanners for Weighted Points ⋮ Near-linear-time deterministic plane Steiner spanners for well-spaced point sets ⋮ The minimum Manhattan network problem: Approximations and exact solutions ⋮ On the power of the semi-separated pair decomposition ⋮ Sparse communication networks and efficient routing in the plane ⋮ Local Algorithms for Bounded Degree Sparsifiers in Sparse Graphs ⋮ Geometric Spanner of Segments ⋮ Testing Euclidean Spanners ⋮ Small hop-diameter sparse spanners for doubling metrics ⋮ Generalized self-approaching curves ⋮ Approximating minimum Manhattan networks in higher dimensions ⋮ Sparse fault-tolerant spanners for doubling metrics with bounded hop-diameter or degree ⋮ Low-light trees, and tight lower bounds for Euclidean spanners ⋮ On Euclidean vehicle routing with allocation ⋮ Pruning spanners and constructing well-separated pair decompositions in the presence of memory hierarchies ⋮ Graph spanners: a tutorial review ⋮ Deformable spanners and applications ⋮ The Orthant Neighborhood Graph: A Decentralized Spatial Data Structure for Dynamic Point Sets ⋮ Vertex fault-tolerant spanners for weighted points in polygonal domains ⋮ Computing a Minimum-Cost k-Hop Steiner Tree in Tree-Like Metrics ⋮ Covering Metric Spaces by Few Trees ⋮ Light Spanners ⋮ Local routing in a tree metric \(1\)-spanner ⋮ On Hop-Constrained Steiner Trees in Tree-Like Metrics