Improved Minmax Regret 1-Center Algorithms for Cactus Networks with c Cycles

DOI10.1007/978-3-642-54423-1_29zbMath1405.68237OpenAlexW376983380MaRDI QIDQ5405052

Tsunehiko Kameda, Zhao Song, Binay K. Bhattacharya

Publication date: 31 March 2014

Published in: LATIN 2014: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-54423-1_29

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Discrete location and assignment (90B80)

Related Items (2)

New approaches to the robust 1-center location problems on tree networks ⋮ Minmax regret 1-center algorithms for path/tree/unicycle/cactus networks

This page was built for publication: Improved Minmax Regret 1-Center Algorithms for Cactus Networks with c Cycles