The backup 2-median problem on block graphs

DOI10.1007/s10255-014-0294-yzbMath1305.90248OpenAlexW1964532117MaRDI QIDQ403496

Yu-kun Cheng, Hong Yan, Li-ying Kang

Publication date: 29 August 2014

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10255-014-0294-y

zbMATH Keywords

location theorymedianblock graphbackup

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Related Items (1)

Embeddings into almost self-centered graphs of given radius

Cites Work

• Median problems with positive and negative weights on cycles and cacti
• The \(p\)-Maxian problem on interval graphs
• The \(p\)-maxian problem on block graphs
• The pos/neg-weighted median problem on block graphs with subgraph-shaped customers
• A polynomial method for the pos/neg weighted 3-median problem on a tree
• A linear algorithm for the pos/neg-weighted 1-median problem on a cactus
• 2-medians in trees with pos/neg weights
• The pos/neg-weighted 1-median problem on tree graphs with subtree-shaped customers
• Median problems on wheels and cactus graphs
• The \(p\)-maxian problem on a tree
• An \(O(pn^ 2)\) algorithm for the \(p\)-median and related problems on tree graphs
• The 1-Center Problem: Exploiting Block Structure
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• Spanning Trees and Optimization Problems
• Computing the 2‐median on tree networks in O(n lg n) time
• The backup 2‐center and backup 2‐median problems on trees
• Efficient computation of 2-medians in a tree network with positive/negative weights

This page was built for publication: The backup 2-median problem on block graphs