Pages that link to "Item:Q1879251"
From MaRDI portal
The following pages link to Minimum \(k\) arborescences with bandwidth constraints (Q1879251):
Displaying 7 items.
- Edge-bandwidth of grids and tori (Q861250) (← links)
- On routing in VLSI design and communication networks (Q944702) (← links)
- Packing trees in communication networks (Q1016048) (← links)
- Counting minimum weight arborescences (Q1799229) (← links)
- MaxMin allocation via degree lower-bounded arborescences (Q5172749) (← links)
- Precedence-constrained arborescences (Q6109804) (← links)
- A branch-and-bound algorithm for the precedence-constrained minimum-cost arborescence problem (Q6164630) (← links)