An optimal algorithm for the weighted backup 2-center problem on a tree
From MaRDI portal
Publication:513273
DOI10.1007/s00453-015-0081-zzbMath1358.90069arXiv1409.0098OpenAlexW1751974959MaRDI QIDQ513273
Publication date: 3 March 2017
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1409.0098
Related Items
A quadratic time exact algorithm for continuous connected 2-facility location problem in trees ⋮ An algorithm for solving the bi-objective median path-shaped facility on a tree network
Cites Work
- Unnamed Item
- Backup 2-center on interval graphs
- Lagrangean duals and exact solution to the capacitated \(p\)-center problem
- A heuristic for the p-center problem in graphs
- Sorting weighted distances with applications to objective function evaluations in single facility location problems.
- Algorithms for the robust 1-center problem on a tree
- Efficient algorithms for center problems in cactus networks
- Back-Up 2-Center on a Path/Tree/Cycle/Unicycle
- An Optimal Algorithm for the Continuous/Discrete Weighted 2-Center Problem in Trees
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
- An Algorithmic Approach to Network Location Problems. I: Thep-Centers
- Minimax regret p-center location on a network with demand uncertainty
- The backup 2‐center and backup 2‐median problems on trees
