Pages that link to "Item:Q2938749"
From MaRDI portal
The following pages link to Minimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform Capacity (Q2938749):
Displaying 13 items.
- Minimax regret 1-median problem in dynamic path networks (Q726099) (← links)
- An \(O(n \log^2 n)\) algorithm for the optimal sink location problem in dynamic tree networks (Q860399) (← links)
- Improved algorithms for computing minmax regret sinks on dynamic path and tree networks (Q896121) (← links)
- 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)
- Minimax regret 1-sink location problem in dynamic path networks (Q2348257) (← links)
- (Q5091004) (← links)
- Minimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform Capacity (Q5746252) (← links)
- Almost linear time algorithms for minsum \(k\)-sink problems on dynamic flow path networks (Q5918293) (← 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)
