Multiple sink location problems in dynamic path networks
From MaRDI portal
Publication:897956
DOI10.1016/j.tcs.2015.05.053zbMath1332.68079OpenAlexW578809909MaRDI QIDQ897956
Mordecai J. Golin, Yuya Higashikawa, Naoki Katoh
Publication date: 8 December 2015
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2015.05.053
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Deterministic network models in operations research (90B10)
Related Items
Multiple sink location problem in path networks with a combinational objective ⋮ Multi-depot traveling salesmen location problems on networks with special structure ⋮ Capacity provisioning for evacuation on path networks ⋮ Minmax regret 1-sink location problems on dynamic flow path networks with parametric weights ⋮ Unnamed Item ⋮ Minimax regret 1-median problem in dynamic path networks ⋮ Minsum \(k\)-sink problem on path networks ⋮ Almost linear time algorithms for minsum \(k\)-sink problems on dynamic flow path networks ⋮ Distributed Evacuation in Graphs with Multiple Exits ⋮ Minmax regret \(k\)-sink location on a dynamic path network with uniform capacities
Cites Work
- An \(O(n \log^2 n)\) algorithm for the optimal sink location problem in dynamic tree networks
- Minimax regret 1-sink location problem in dynamic path networks
- Computing a Minimum Weightk-Link Path in Graphs with the Concave Monge Property
- Minimax Regret 1-Sink Location Problems in Dynamic Path Networks
- Multiple Sink Location Problems in Dynamic Path Networks
- Constructing Maximal Dynamic Flows from Static Flows
- Minimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform Capacity
