Recommendations
Cites work
- 2-medians in trees with pos/neg weights
- A linear algorithm for the pos/neg-weighted 1-median problem on a cactus
- A polynomial method for the pos/neg weighted 3-median problem on a tree
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- An O(pn^ 2) algorithm for the p-median and related problems on tree graphs
- Computing the 2‐median on tree networks in O(n lg n) time
- Efficient computation of 2-medians in a tree network with positive/negative weights
- Median problems on wheels and cactus graphs
- Median problems with positive and negative weights on cycles and cacti
- Spanning Trees and Optimization Problems
- The 1-Center Problem: Exploiting Block Structure
- The \(p\)-Maxian problem on interval graphs
- The p-maxian problem on a tree
- The \(p\)-maxian problem on block graphs
- The backup 2‐center and backup 2‐median problems on trees
- The pos/neg-weighted 1-median problem on tree graphs with subtree-shaped customers
- The pos/neg-weighted median problem on block graphs with subgraph-shaped customers
Cited in
(6)- Backup multifacility location problem with \(l_p\) norm
- The backup 2‐center and backup 2‐median problems on trees
- Backup 2-center on interval graphs
- Back-up 2-center on a path/tree/cycle/unicycle
- Embeddings into almost self-centered graphs of given radius
- An optimal algorithm for the weighted backup 2-center problem on a tree
This page was built for publication: The backup 2-median problem on block graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q403496)
