Minmax regret 1-center algorithms for path/tree/unicycle/cactus networks
From MaRDI portal
Publication:496433
DOI10.1016/J.DAM.2014.10.022zbMATH Open1320.05055OpenAlexW1977160818MaRDI QIDQ496433FDOQ496433
Authors: Tsunehiko Kameda, Zhao Song, Binay Bhattacharya 
Publication date: 21 September 2015
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2014.10.022
Recommendations
- Improved minmax regret 1-center algorithms for cactus networks with \(c\) cycles
- On the minmax regret path center problem on trees
- Efficient algorithms for the minmax regret path center problem with length constraint on trees
- An improved algorithm for the minmax regret path center problem on trees
- Improved Algorithms for the Minmax-Regret 1-Center Problem
- An improved algorithm for the minmax regret path centdian problem on trees
- Improved algorithms for computing minmax regret sinks on dynamic path and tree networks
- Improved Algorithms for Computing Minmax Regret 1-Sink and 2-Sink on Path Network
Cites Work
- Title not available (Why is that?)
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
- Minimax regret p-center location on a network with demand uncertainty
- Minmax-regret robust 1-median location on a tree
- Algorithms for the robust 1-center problem on a tree
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
- Improved algorithms for the minmax-regret 1-center and 1-median problems
- A note on the minmax regret centdian location on trees
- Location science research: a review
- A linear algorithm for the pos/neg-weighted 1-median problem on a cactus
- An \(O(pn^ 2)\) algorithm for the \(p\)-median and related problems on tree graphs
- Finding the upper envelope of n line segments in O(n log n) time
- A note on the robust 1-center problem on trees
- Complexity of robust single facility location problems on networks with uncertain edge lengths.
- New Results on the Complexity of p-Centre Problems
- Efficient algorithms for center problems in cactus networks
- Fractional cascading. II: Applications
- Minimax regret path location on trees
- Off-Line Maintenance of Planar Configurations
- Improved minmax regret 1-center algorithms for cactus networks with \(c\) cycles
- Mathematical Foundations of Computer Science 2003
Cited In (9)
- Improved minmax regret 1-center algorithms for cactus networks with \(c\) cycles
- Efficient algorithms for the minmax regret path center problem with length constraint on trees
- An improved algorithm for the minmax regret path center problem on trees
- A quadratic time exact algorithm for continuous connected 2-facility location problem in trees
- Minmax regret 1-facility location on uncertain path networks
- Minmax regret 1-facility location on uncertain path networks
- New approaches to the robust 1-center location problems on tree networks
- Minmax regret \(k\)-sink location on a dynamic path network with uniform capacities
- Constant work-space algorithms for facility location problems
This page was built for publication: Minmax regret 1-center algorithms for path/tree/unicycle/cactus networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q496433)
