Improved algorithms for computing \(k\)-sink on dynamic flow path networks
From MaRDI portal
Publication:2405281
DOI10.1007/978-3-319-62127-2_12zbMath1493.68261arXiv1609.01373OpenAlexW2964057732MaRDI QIDQ2405281
Binay K. Bhattacharya, Tsunehiko Kameda, Mordecai J. Golin, Yuya Higashikawa, Naoki Katoh
Publication date: 22 September 2017
Full work available at URL: https://arxiv.org/abs/1609.01373
Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Discrete location and assignment (90B80)
Related Items
Multiple sink location problem in path networks with a combinational objective ⋮ Minmax regret for sink location on dynamic flow paths with general capacities ⋮ Minmax centered \(k\)-partitioning of trees and applications to sink evacuation with dynamic confluent flows ⋮ Capacity provisioning for evacuation on path networks ⋮ Minmax regret 1-sink location problems on dynamic flow path networks with parametric weights ⋮ Minsum \(k\)-sink problem on path networks ⋮ Almost linear time algorithms for minsum \(k\)-sink problems on dynamic flow path networks ⋮ Minmax regret \(k\)-sink location on a dynamic path network with uniform capacities
