scientific article; zbMATH DE number 1263225
From MaRDI portal
Publication:4234097
Recommendations
- Optimal Euclidean Spanners
- Optimal Euclidean spanners, really short, thin and lanky
- Sparse Euclidean Spanners with Tiny Diameter
- Euclidean spanners in high dimensions
- Euclidean Steiner spanners: light and sparse
- An optimal-time construction of sparse Euclidean spanners with tiny diameter
- Lower bound for sparse Euclidean spanners
- Geometric Spanner of Objects under L 1 Distance
Cited in
(57)- Approximating geometric bottleneck shortest paths
- On the power of the semi-separated pair decomposition
- Graph spanners: a tutorial review
- Local routing in a tree metric 1-spanner
- Covering metric spaces by few trees
- Sparse fault-tolerant spanners for doubling metrics with bounded hop-diameter or degree
- On Euclidean vehicle routing with allocation
- Efficient construction of a bounded-degree spanner with low weight
- The minimum Manhattan network problem: Approximations and exact solutions
- Deformable spanners and applications
- Lower bound for sparse Euclidean spanners
- Sparse Euclidean Spanners with Tiny Diameter
- New Doubling Spanners: Better and Simpler
- Optimal Euclidean Spanners
- On the Power of the Semi-Separated Pair Decomposition
- Geometric Spanner Networks
- Geometric Spanner of Objects under L 1 Distance
- Testing Euclidean Spanners
- The Orthant Neighborhood Graph: A Decentralized Spatial Data Structure for Dynamic Point Sets
- On Spanners of Geometric Graphs
- scientific article; zbMATH DE number 1830742 (Why is no real title available?)
- Testing Euclidean Spanners
- Local algorithms for bounded degree sparsifiers in sparse graphs
- Truly Optimal Euclidean Spanners
- Computing a Minimum-Cost k-Hop Steiner Tree in Tree-Like Metrics
- Covering Metric Spaces by Few Trees
- Sparse communication networks and efficient routing in the plane
- Local Construction and Coloring of Spanners of Location Aware Unit Disk Graphs
- A geometric spanner of segments
- Geometric Spanner of Segments
- Light spanners
- Euclidean spanners in high dimensions
- On Hop-Constrained Steiner Trees in Tree-Like Metrics
- Small hop-diameter sparse spanners for doubling metrics
- Generalized self-approaching curves
- Ordered theta graphs
- Online Euclidean Spanners
- Local routing algorithms on Euclidean spanners with small diameter
- Vertex Fault-Tolerant Geometric Spanners for Weighted Points
- Vertex fault-tolerant spanners for weighted points in polygonal domains
- A unified framework for light spanners
- A unified framework of light spanners. I: Fast (yet optimal) constructions
- Optimal Euclidean tree covers
- An o(n n)-time approximation scheme for geometric many-to-many matching
- Truly optimal Euclidean spanners
- Greedy spanners in Euclidean spaces admit sublinear separators
- Embeddings and near-neighbor searching with constant additive error for hyperbolic spaces
- The complexity of geodesic spanners using Steiner points
- Optimal Euclidean tree covers
- Lower bounds on tree covers
- A WSPD, separator and small tree cover for c-packed graphs
- Light spanners with small hop-diameter
- Routing on heavy-path WSPD-spanners
- Minimum power assignment in wireless ad hoc networks with spanner property
- Near-linear-time deterministic plane Steiner spanners for well-spaced point sets
- Low-light trees, and tight lower bounds for Euclidean spanners
- Pruning spanners and constructing well-separated pair decompositions in the presence of memory hierarchies
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4234097)
