Almost linear time algorithms for minsum \(k\)-sink problems on dynamic flow path networks
From MaRDI portal
Publication:5925664
DOI10.1007/978-3-030-64843-5_14OpenAlexW3115858049MaRDI QIDQ5925664
Yuya Higashikawa, Naoki Katoh, Junichi Teruyama, Koji Watase
Publication date: 21 March 2023
Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-64843-5_14
facility location problemspersistent data structuresdynamic flow networksminimum k-link path problem
Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (1)
This page was built for publication: Almost linear time algorithms for minsum \(k\)-sink problems on dynamic flow path networks