Minmax regret 1-center algorithms for path/tree/unicycle/cactus networks
type: Item
instance of: scholarly article
title: Minmax regret 1-center algorithms for path/tree/unicycle/cactus networks
zbMATH Open document ID: 1320.05055
author: Tsunehiko Kameda
author: Zhao Song
author: Binay Bhattacharya
published in: Discrete Applied Mathematics
publication date: 2015-09-21T00:00:00Z
Mathematics Subject Classification ID: 05C22
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 6483956
zbMATH Keywords: facility location
zbMATH Keywords: 1-center problem
zbMATH Keywords: minmax regret optimization
zbMATH Keywords: robust solution
zbMATH Keywords: uncertain weight
MaRDI profile type: Publication
full work available at URL: j.dam.2014.10.022
OpenAlex ID: W1977160818
cites work: Complexity of robust single facility location problems on networks with uncertain edge lengths.
cites work: Minimax regret p-center location on a network with demand uncertainty
cites work: Algorithms for the robust 1-center problem on a tree
cites work: Mathematical Foundations of Computer Science 2003
cites work: Efficient algorithms for center problems in cactus networks
cites work: Improved Minmax Regret 1-Center Algorithms for Cactus Networks with c Cycles
cites work: A note on the robust 1-center problem on trees
cites work: A linear algorithm for the pos/neg-weighted 1-median problem on a cactus
cites work: Fractional cascading. II: Applications
cites work: Minmax-regret robust 1-median location on a tree
cites work: A note on the minmax regret centdian location on trees
cites work: Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
cites work: Location science research: a review
cites work: Finding the upper envelope of n line segments in O(n log n) time
cites work: Off-Line Maintenance of Planar Configurations
cites work: Q4057549
cites work: Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
cites work: New Results on the Complexity of p-Centre Problems
cites work: Minimax regret path location on trees
cites work: An \(O(pn^ 2)\) algorithm for the \(p\)-median and related problems on tree graphs
cites work: Improved algorithms for the minmax-regret 1-center and 1-median problems
DOI: 10.1016/J.DAM.2014.10.022
Recommended article: Improved Minmax Regret 1-Center Algorithms for Cactus Networks with c Cycles
Recommended article: On the minmax regret path center problem on trees
Recommended article: Efficient algorithms for the minmax regret path center problem with length constraint on trees
Recommended article: An improved algorithm for the minmax regret path center problem on trees
Recommended article: Improved Algorithms for the Minmax-Regret 1-Center Problem
Recommended article: An improved algorithm for the minmax regret path centdian problem on trees
Recommended article: Minimax regret 1-median problem in dynamic path networks
Recommended article: Improved algorithms for computing minmax regret sinks on dynamic path and tree networks
Recommended article: Improved Algorithms for Computing Minmax Regret 1-Sink and 2-Sink on Path Network
description: scientific article; zbMATH DE number 6483956