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

DOI10.1007/s00607-010-0084-1zbMath1208.90108OpenAlexW1977215779MaRDI QIDQ985733

Yu-kun Cheng, Xiao-Qin Zhang, Li-ying Kang

Publication date: 6 August 2010

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00607-010-0084-1

zbMATH Keywords

location theoryblock graphmedian problemsubgraph-shaped customers

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Discrete location and assignment (90B80)

Related Items (2)

The connected \(p\)-median problem on block graphs ⋮ The backup 2-median problem on block graphs

Cites Work

• Optimal vertex ranking of block graphs
• Center location problems on tree graphs with subtree-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
• Optimal path cover problem on block graphs
• The pos/neg-weighted 1-median problem on tree graphs with subtree-shaped customers
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• Efficient computation of 2-medians in a tree network with positive/negative weights
• Unnamed Item

This page was built for publication: The pos/neg-weighted median problem on block graphs with subgraph-shaped customers