Pages that link to "Item:Q1840509"
From MaRDI portal
The following pages link to Near-optimal bounded-degree spanning trees (Q1840509):
Displaying 5 items.
- On approximating tree spanners that are breadth first search trees (Q269500) (← links)
- On finding optimal and near-optimal lineal spanning trees (Q1105381) (← links)
- Bounded-degree light approximate shortest-path trees in doubling metrics (Q2235274) (← links)
- Lower bound for the cost of connecting tree with given vertex degree sequence (Q4958799) (← links)
- Euclidean Bottleneck Bounded-Degree Spanning Tree Ratios (Q5146820) (← links)