Pages that link to "Item:Q3096090"
From MaRDI portal
The following pages link to Degree Bounded Network Design with Metric Costs (Q3096090):
Displaying 5 items.
- Degree constrained node-connectivity problems (Q486998) (← links)
- Liftings in finite graphs and linkages in infinite graphs with prescribed edge-connectivity (Q503651) (← links)
- Approximating bounded-degree spanning trees and connected factors with leaves (Q1728165) (← links)
- Approximation algorithms for connected graph factors of minimum weight (Q1743127) (← links)
- Design networks with bounded pairwise distance (Q2819606) (← links)
