✦ LIBER ✦

The backup 2-median problem on block graphs

✍ Scribed by Cheng, Yu-kun; Kang, Li-ying; Yan, Hong

Book ID: 125353408
Publisher: Institute of Applied Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
Year: 2014
Tongue: English
Weight: 278 KB
Volume: 30
Category: Article
ISSN: 0168-9673
DOI: 10.1007/s10255-014-0294-y

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The backup 2-center and backup 2-median

The backup 2-center and backup 2-median problems on trees

✍ Hung-Lung Wang; Bang Ye Wu; Kun-Mao Chao 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 164 KB

The pos/neg-weighted median problem on b

The pos/neg-weighted median problem on block graphs with subgraph-shaped customers

✍ Xiaoqin Zhang; Liying Kang; Yukun Cheng 📂 Article 📅 2010 🏛 Springer Vienna 🌐 English ⚖ 305 KB

Backup 2-center on interval graphs

✍ Yanmei Hong; Liying Kang 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 279 KB

Thep-maxian problem on block graphs

✍ Liying Kang; Yukun Cheng 📂 Article 📅 2008 🏛 Springer US 🌐 English ⚖ 338 KB

Median problems on wheels and cactus gra

Median problems on wheels and cactus graphs

✍ J. Hatzl 📂 Article 📅 2007 🏛 Springer Vienna 🌐 English ⚖ 168 KB

Block-vertex duality and the one-median

Block-vertex duality and the one-median problem

✍ M.-L. Chen; R. L. Francis; J. F. Lawrence; T. J. Lowe; S. Tufekci 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 854 KB

The w-centroid problem, denoted by (C), is an optimization problem which has been shown by Kariv and Hakimi to be equivalent, on a tree graph, to the 1-median location problem, denoted by (M). For a general (weighted) connected graph G we develop a duality between (C) (which is defined on G) and a b