Pages that link to "Item:Q4636507"
From MaRDI portal
The following pages link to Sink Evacuation on Trees with Dynamic Confluent Flows (Q4636507):
Displaying 11 items.
- Minmax regret for sink location on dynamic flow paths with general capacities (Q2133396) (← links)
- Minmax regret 1-sink location problems on dynamic flow path networks with parametric weights (Q2232232) (← links)
- Minsum \(k\)-sink problem on path networks (Q2285143) (← links)
- Minmax regret \(k\)-sink location on a dynamic path network with uniform capacities (Q2319636) (← links)
- Almost linear time algorithms for minsum \(k\)-sink problems on dynamic flow path networks (Q5918293) (← links)
- Minmax centered \(k\)-partitioning of trees and applications to sink evacuation with dynamic confluent flows (Q6107888) (← links)
- Capacity provisioning for evacuation on path networks (Q6179704) (← links)
- Sink location problems in dynamic flow grid networks (Q6591466) (← links)
- Faster algorithms for evacuation problems in networks with a single sink of small degree and bounded capacitated edges (Q6606161) (← links)
- Minmax regret 1-sink location problems on dynamic flow path networks with parametric weights (Q6621860) (← links)
- Faster algorithms for evacuation problems in networks with a single sink of small degree and bounded capacitated edges (Q6646736) (← links)
