Pages that link to "Item:Q3595405"
From MaRDI portal
The following pages link to A Tight Lower Bound for the Steiner Point Removal Problem on Trees (Q3595405):
Displaying 11 items.
- Terminal embeddings (Q2405893) (← links)
- Steiner Point Removal with Distortion $O(\log {k})$ using the Relaxed-Voronoi Algorithm (Q4634019) (← links)
- Distance-Preserving Graph Contractions (Q4993321) (← links)
- (Q5009573) (← links)
- (Q5111733) (← links)
- Refined Vertex Sparsifiers of Planar Graphs (Q5208742) (← links)
- Improved Guarantees for Vertex Sparsification in Planar Graphs (Q5208743) (← links)
- Distance-Preserving Graph Contractions (Q5233754) (← links)
- Cutting Corners Cheaply, or How to Remove Steiner Points (Q5502176) (← links)
- Reachability Preservers: New Extremal Bounds and Approximation Algorithms (Q6154193) (← links)
- Online Spanners in Metric Spaces (Q6195959) (← links)
