Pages that link to "Item:Q4537619"
From MaRDI portal
The following pages link to Light graphs with small routing cost (Q4537619):
Displaying 12 items.
- Network design for time-constrained delivery using subgraphs (Q395697) (← links)
- Balancing minimum spanning trees and multiple-source minimum routing cost spanning trees on metric graphs (Q845678) (← links)
- Approximation algorithms for the optimal \(p\)-source communication spanning tree (Q1887037) (← links)
- Light spanners for high dimensional norms via stochastic decompositions (Q2088589) (← links)
- Bounded-degree light approximate shortest-path trees in doubling metrics (Q2235274) (← links)
- On the minimum routing cost clustered tree problem (Q2359809) (← links)
- On the<i>k</i>-ary hypercube tree and its average distance (Q3101622) (← links)
- On the average distance of the hypercube tree (Q3568450) (← links)
- The Greedy Spanner Is Existentially Optimal (Q4960447) (← links)
- (Q5009588) (← links)
- Light Spanners (Q5499739) (← links)
- Steiner Shallow-Light Trees Are Exponentially Lighter than Spanning Ones (Q5502177) (← links)
