Improved minmax regret 1-center algorithms for cactus networks with c cycles

DOI10.1007/978-3-642-54423-1_29zbMATH Open1405.68237OpenAlexW376983380MaRDI QIDQ5405052FDOQ5405052

Authors: Binay Bhattacharya, Tsunehiko Kameda, Zhao Song 

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

Recommendations

• Minmax regret 1-center algorithms for path/tree/unicycle/cactus networks
• Computing minmax regret 1-median on a tree network with positive/negative vertex weights
• A linear time algorithm for computing minmax regret 1-median on a tree network
• Improved Algorithms for the Minmax-Regret 1-Center Problem
• A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree

Mathematics Subject Classification ID

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

Cited In (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

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