The following pages link to Geometric Spanner Networks (Q3445775):
Displaying 50 items.
- Optimizing budget allocation for center and median points (Q265070) (← links)
- A lower bound for computing geometric spanners (Q265718) (← links)
- On approximating tree spanners that are breadth first search trees (Q269500) (← links)
- Models and algorithms for network reduction (Q320811) (← links)
- On plane geometric spanners: a survey and open problems (Q359741) (← links)
- Fast query structures in anisotropic media (Q391227) (← links)
- Theta-3 is connected (Q396473) (← links)
- Minimum weight Euclidean \(t\)-spanner is NP-hard (Q396666) (← links)
- New constructions of SSPDs and their applications (Q419372) (← links)
- The MST of symmetric disk graphs is light (Q425622) (← links)
- On bounded degree plane strong geometric spanners (Q450575) (← links)
- Angle-constrained spanners with angle at least \(\pi/3\) (Q506169) (← links)
- Space-efficient path-reporting approximate distance oracles (Q517013) (← links)
- Distribution-sensitive construction of the greedy spanner (Q527422) (← links)
- Kinetic spanners in \(\mathbb R^{d}\) (Q540440) (← links)
- Minimum weight convex Steiner partitions (Q548652) (← links)
- Geodesics and flows in a Poissonian city (Q549856) (← links)
- On a family of strong geometric spanners that admit local routing strategies (Q551501) (← links)
- On the stretch factor of Delaunay triangulations of points in convex position (Q621926) (← links)
- Almost all Delaunay triangulations have stretch factor greater than \(\pi /2\) (Q621930) (← links)
- Approximation of minimum weight spanners for sparse graphs (Q627187) (← links)
- Geometric spanners for weighted point sets (Q634687) (← links)
- Spanners of additively weighted point sets (Q635742) (← links)
- Stable roommates spanner (Q691764) (← links)
- Improved local algorithms for spanner construction (Q714769) (← links)
- Fixed-orientation equilateral triangle matching of point sets (Q744055) (← links)
- The reach of axis-aligned squares in the plane (Q783038) (← links)
- Multi-colored spanning graphs (Q784473) (← links)
- \( \delta \)-greedy \(t\)-spanner (Q824327) (← links)
- Sparse hop spanners for unit disk graphs (Q824328) (← links)
- On the plane angle-monotone graphs (Q824336) (← links)
- Linear-size planar Manhattan network for convex point sets (Q824337) (← links)
- An improved construction for spanners of disks (Q827306) (← links)
- Angle-monotonicity of Delaunay triangulation (Q827337) (← links)
- On the spanning and routing ratios of the directed \(\varTheta_6\)-graph (Q832828) (← links)
- The minimum moving spanning tree problem (Q832829) (← links)
- Routing on heavy-path WSPD-spanners (Q832910) (← links)
- Algorithms for graphs of bounded treewidth via orthogonal range searching (Q833703) (← links)
- On the dilation spectrum of paths, cycles, and trees (Q833719) (← links)
- Computing the greedy spanner in linear space (Q893321) (← links)
- Towards tight bounds on theta-graphs: more is not always better (Q906396) (← links)
- Connected spatial networks over random points and a route-length statistic (Q906528) (← links)
- Near-linear-time deterministic plane Steiner spanners for well-spaced point sets (Q906836) (← links)
- Constructing minimum-interference networks (Q929744) (← links)
- Sparse geometric graphs with small dilation (Q929746) (← links)
- I/O-efficient algorithms for computing planar geometric spanners (Q929749) (← links)
- Geometric spanners with small chromatic number (Q955227) (← links)
- Well-separated pair decomposition in linear time? (Q963421) (← links)
- Low-light trees, and tight lower bounds for Euclidean spanners (Q972609) (← links)
- Pruning spanners and constructing well-separated pair decompositions in the presence of memory hierarchies (Q988687) (← links)