The following pages link to (Q4945509):
Displaying 50 items.
- The saga of minimum spanning trees (Q458468) (← links)
- Angle-constrained spanners with angle at least \(\pi/3\) (Q506169) (← links)
- Kinetic spanners in \(\mathbb R^{d}\) (Q540440) (← links)
- Minimum weight convex Steiner partitions (Q548652) (← links)
- Long non-crossing configurations in the plane (Q603879) (← links)
- On bounded leg shortest paths problems (Q633848) (← links)
- Optimal spanners for axis-aligned rectangles (Q706725) (← links)
- On the longest spanning tree with neighborhoods (Q777263) (← links)
- Sparse hop spanners for unit disk graphs (Q824328) (← links)
- An improved construction for spanners of disks (Q827306) (← links)
- On the spanning and routing ratios of the directed \(\varTheta_6\)-graph (Q832828) (← links)
- On the dilation spectrum of paths, cycles, and trees (Q833719) (← links)
- On stars and Steiner stars (Q834191) (← links)
- Geometric spanners with applications in wireless networks (Q868107) (← links)
- On the geometric dilation of closed curves, graphs, and point sets (Q870424) (← links)
- Minimum dilation stars (Q871060) (← links)
- Geometric dilation of closed planar curves: New lower bounds (Q883237) (← links)
- Near-linear-time deterministic plane Steiner spanners for well-spaced point sets (Q906836) (← links)
- Sparse geometric graphs with small dilation (Q929746) (← links)
- I/O-efficient algorithms for computing planar geometric spanners (Q929749) (← links)
- Computing a minimum-dilation spanning tree is NP-hard (Q945943) (← links)
- Pruning spanners and constructing well-separated pair decompositions in the presence of memory hierarchies (Q988687) (← links)
- Light orthogonal networks with constant geometric dilation (Q1013080) (← links)
- Region-fault tolerant geometric spanners (Q1016540) (← links)
- Computing the dilation of edge-augmented graphs in metric spaces (Q1037772) (← links)
- A fast algorithm for approximating the detour of a polygonal chain. (Q1428113) (← links)
- Beta-skeletons have unbounded dilation (Q1614068) (← links)
- Improved upper bounds for the Steiner ratio (Q1662104) (← links)
- An exact algorithm for the minimum dilation triangulation problem (Q1679486) (← links)
- Upper bounds for minimum dilation triangulation in two special cases (Q1705701) (← links)
- Computing a \((1+\varepsilon)\)-approximate geometric minimum-diameter spanning tree (Q1879253) (← links)
- Approximating geometric bottleneck shortest paths (Q1886239) (← links)
- On the power of the semi-separated pair decomposition (Q1947974) (← links)
- Computing the greedy spanner in near-quadratic time (Q1957650) (← links)
- On the spanning and routing ratios of the directed \(\Theta_6\)-graph (Q2144459) (← links)
- Spanning properties of Theta-Theta-6 (Q2175787) (← links)
- Plane hop spanners for unit disk graphs: simpler and better (Q2206719) (← links)
- Most finite point sets in the plane have dilation \(>1\) (Q2256585) (← links)
- A near linear time approximation scheme for Steiner tree among obstacles in the plane (Q2269141) (← links)
- The folk solution and Boruvka's algorithm in minimum cost spanning tree problems (Q2275934) (← links)
- On the shortest separating cycle (Q2306364) (← links)
- An improved upper bound on dilation of regular polygons (Q2330038) (← links)
- Average stretch factor: how low does it go? (Q2340408) (← links)
- Distributed construction of low-interference spanners (Q2377128) (← links)
- Minimum Manhattan network problem in normed planes with polygonal balls: a factor 2.5 approximation algorithm (Q2429332) (← links)
- The minimum Manhattan network problem: Approximations and exact solutions (Q2432734) (← links)
- The minimum-area spanning tree problem (Q2432736) (← links)
- A rounding algorithm for approximating minimum Manhattan networks (Q2474072) (← links)
- A PTAS for minimum vertex dilation triangulation of a simple polygon with a constant number of sources of dilation (Q2489546) (← links)
- Deformable spanners and applications (Q2507157) (← links)
