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

DOI10.1007/978-3-319-12691-3_12zbMATH Open1333.90068OpenAlexW139806551MaRDI QIDQ2942389FDOQ2942389

Authors: Binay 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

Recommendations

• Improved algorithms for computing minmax regret sinks on dynamic path and tree networks
• An \(O(n^2\log^2 n)\) time algorithm for minmax regret minsum sink on path networks
• Minimax regret 1-sink location problems in dynamic path networks
• Minimax regret 1-sink location problem in dynamic path networks
• Minimax regret vertex 2-sink location problem in dynamic path networks
• On the approximability of minmax (regret) network optimization problems
• Minimax regret k-sink location problem in dynamic path networks
• Minmax regret \(k\)-sink location on a dynamic path network with uniform capacities

Mathematics Subject Classification ID

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

Cited In (3)

• Improved algorithms for computing minmax regret sinks on dynamic path and tree networks
• Minmax regret 1-center algorithms for path/tree/unicycle/cactus networks
• An \(O(n^2\log^2 n)\) time algorithm for minmax regret minsum sink on path networks

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2942389)