The backup 2‐center and backup 2‐median problems on trees
From MaRDI portal
Publication:5191127
DOI10.1002/net.20261zbMath1192.68058OpenAlexW4237257980MaRDI QIDQ5191127
Kun-Mao Chao, Hung-Lung Wang, Bang Ye Wu
Publication date: 28 July 2009
Published in: Networks (Search for Journal in Brave)
Full work available at URL: http://ntur.lib.ntu.edu.tw/bitstream/246246/154575/3/91.pdf
Trees (05C05) Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Embeddings into almost self-centered graphs of given radius ⋮ The backup 2-median problem on block graphs ⋮ Almost self-centered graphs ⋮ Backup 2-center on interval graphs ⋮ Maintaining centdians in a fully dynamic forest with top trees ⋮ An optimal algorithm for the weighted backup 2-center problem on a tree ⋮ The 2-radius and 2-radiian problems on trees ⋮ Backup multifacility location problem with \(l_p\) norm
Cites Work
- Unnamed Item
- Unnamed Item
- Algorithms for the robust 1-center problem on a tree
- A linear-time algorithm for solving the center problem on weighted cactus graphs
- A note on the robust 1-center problem on trees
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
- New Results on the Complexity of p-Centre Problems
- Algorithms for finding P-centers on a weighted tree (for relatively small P)
- Solving NP-Hard Problems on Graphs That Are Almost Trees and an Application to Facility Location Problems
- An Algorithmic Approach to Network Location Problems. I: Thep-Centers
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- Minimax regret p-center location on a network with demand uncertainty
- Minmax-regret robust 1-median location on a tree
- Minmax Regret Median Location on a Network Under Uncertainty
- Spanning Trees and Optimization Problems
- Finding kth paths and p-centers by generating and searching good data structures
- An improved algorithm for the minmax regret median problem on a tree
- Computing the 2‐median on tree networks in O(n lg n) time
- Improved Algorithms for the Minmax-Regret 1-Center Problem
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
- Algorithms and Computation
