The following pages link to New pairwise spanners (Q1693988):
Displaying 7 items.
- Graph spanners: a tutorial review (Q2026289) (← links)
- A note on distance-preserving graph sparsification (Q2059887) (← links)
- The sparsest additive spanner via multiple weighted BFS trees (Q2201997) (← links)
- On additive spanners in weighted graphs with local error (Q2672448) (← links)
- Tight Approximation Algorithms for Bichromatic Graph Diameter and Related Problems (Q5091200) (← links)
- New Results on Linear Size Distance Preservers (Q5858650) (← links)
- Reachability Preservers: New Extremal Bounds and Approximation Algorithms (Q6154193) (← links)
