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

DOI10.1007/S00607-010-0084-1MaRDI QIDQ985733zbMATH OpenOpenAlexFDO

Authors Xiaoqin Zhang, Liying Kang, Yu-kun Cheng

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)

Recommendations

• The pos/neg-weighted 1-median problem on tree graphs with subtree-shaped customers
• The pos/neg-weighted 2-medians in balanced trees with subtree-shaped customers
• The connected p-median problem on block graphs
• scientific article; zbMATH DE number 5926326
• A linear algorithm for the pos/neg-weighted 1-median problem on a cactus

Cites work

• scientific article; zbMATH DE number 1803755 (Why is no real title available?)
• 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
• Center location problems on tree graphs with subtree-shaped customers
• Efficient computation of 2-medians in a tree network with positive/negative weights
• Optimal path cover problem on block graphs
• Optimal vertex ranking of block graphs
• The pos/neg-weighted 1-median problem on tree graphs with subtree-shaped customers

Cited in

(4)

• The backup 2-median problem on block graphs
• scientific article; zbMATH DE number 5926326 (Why is no real title available?)
• The connected p-median problem on block graphs
• The pos/neg-weighted 1-median problem on tree graphs with subtree-shaped customers

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q985733)