The following pages link to (Q3140426):
Displaying 11 items.
- Steiner trees with bounded RC-delay (Q527413) (← links)
- Low-light trees, and tight lower bounds for Euclidean spanners (Q972609) (← links)
- The maximum \(f\)-depth spanning tree problem (Q1603381) (← links)
- Shortest shortest path trees of a network (Q1917275) (← links)
- On notions of distortion and an almost minimum spanning tree with constant average distortion (Q2316932) (← links)
- An improved approximation scheme for the Group Steiner Problem (Q2709886) (← links)
- Bicriteria Network Design Problems (Q4216149) (← links)
- Euclidean Steiner Spanners: Light and Sparse (Q5043642) (← links)
- Steiner Shallow-Light Trees Are Exponentially Lighter than Spanning Ones (Q5502177) (← links)
- Compact location problems with budget and communication constraints (Q6064048) (← links)
- The multi-weighted spanning tree problem (Q6085702) (← links)
