Pages that link to "Item:Q5056089"
From MaRDI portal
The following pages link to Generating sparse spanners for weighted graphs (Q5056089):
Displaying 10 items.
- Approximating \(k\)-spanner problems for \(k>2\) (Q557826) (← links)
- On dynamic shortest paths problems (Q639278) (← links)
- Approximating Euclidean distances by small degree graphs (Q1317879) (← links)
- Graph theoretical issues in computer networks (Q1319540) (← links)
- Covering metric spaces by few trees (Q2168848) (← links)
- On graph problems in a semi-streaming model (Q2581265) (← links)
- On additive spanners in weighted graphs with local error (Q2672448) (← links)
- Generating sparse spanners for weighted graphs (Q5056089) (← links)
- Generating sparse 2—spanners (Q5056130) (← links)
- Covering Metric Spaces by Few Trees (Q5091169) (← links)
