The pos/neg-weighted median problem on block graphs with subgraph-shaped customers
type: Item
instance of: scholarly article
title: The pos/neg-weighted median problem on block graphs with subgraph-shaped customers
zbMATH Open document ID: 1208.90108
published in: Computing
publication date: 2010-08-06T00:00:00Z
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 5764653
zbMATH Keywords: location theory
zbMATH Keywords: median problem
zbMATH Keywords: subgraph-shaped customers
zbMATH Keywords: block graph
author: Xiaoqin Zhang
author: Liying Kang
author: Yu-kun Cheng
MaRDI profile type: Publication
full work available at URL: s00607-010-0084-1
OpenAlex ID: W1977215779
cites work: Efficient computation of 2-medians in a tree network with positive/negative weights
cites work: 2-medians in trees with pos/neg weights
cites work: A polynomial method for the pos/neg weighted 3-median problem on a tree
cites work: A linear algorithm for the pos/neg-weighted 1-median problem on a cactus
cites work: The pos/neg-weighted 1-median problem on tree graphs with subtree-shaped customers
cites work: Optimal vertex ranking of block graphs
cites work: An Algorithmic Approach to Network Location Problems. II: Thep-Medians
cites work: Q3147657
cites work: Center location problems on tree graphs with subtree-shaped customers
cites work: Optimal path cover problem on block graphs
DOI: 10.1007/S00607-010-0084-1
description: scientific article; zbMATH DE number 5764653