Improved Algorithms for Computing Minmax Regret 1-Sink and 2-Sink on Path Network

DOI10.1007/978-3-319-12691-3_12zbMath1333.90068OpenAlexW139806551MaRDI QIDQ2942389

Binay K. Bhattacharya, Tsunehiko Kameda

Publication date: 11 September 2015

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-12691-3_12

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Discrete location and assignment (90B80)

Related Items (2)

Improved algorithms for computing minmax regret sinks on dynamic path and tree networks ⋮ Minimax regret 1-median problem in dynamic path networks

This page was built for publication: Improved Algorithms for Computing Minmax Regret 1-Sink and 2-Sink on Path Network