Pages that link to "Item:Q3563015"
From MaRDI portal
The following pages link to Capacitated Confluent Flows: Complexity and Algorithms (Q3563015):
Displaying 3 items.
- Minmax regret for sink location on dynamic flow paths with general capacities (Q2133396) (← links)
- Polynomial-time algorithms for special cases of the maximum confluent flow problem (Q2434729) (← links)
- Minmax centered \(k\)-partitioning of trees and applications to sink evacuation with dynamic confluent flows (Q6107888) (← links)
