The multi-service center problem
type: Item
instance of: scholarly article
title: The multi-service center problem
zbMATH Open document ID: 1380.90166
author: Hung-I Yu
author: Cheng-Chung Li
author: Der-Tsai Lee
published in: Theoretical Computer Science
publication date: 2017-11-16T00:00:00Z
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 6807605
zbMATH Keywords: location theory
zbMATH Keywords: multi-service location problem
zbMATH Keywords: distinct services
zbMATH Keywords: general graphs
zbMATH Keywords: paths
zbMATH Keywords: trees
MaRDI profile type: Publication
full work available at URL: j.tcs.2017.09.034
OpenAlex ID: W2764012768
cites work: An Optimal Algorithm for the Continuous/Discrete Weighted 2-Center Problem in Trees
cites work: Slowing down sorting networks to obtain faster sorting algorithms
cites work: Q4037428
cites work: Q4198056
cites work: Computing the 2‐median on tree networks in O(n lg n) time
cites work: An Algorithmic Approach to Network Location Problems. I: Thep-Centers
cites work: An Algorithmic Approach to Network Location Problems. II: Thep-Medians
cites work: Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
cites work: Linear Programming in Linear Time When the Dimension Is Fixed
cites work: On the computational complexity of centers locating in a graph
cites work: A heuristic for the p-center problem in graphs
cites work: An \(O(pn^ 2)\) algorithm for the \(p\)-median and related problems on tree graphs
DOI: 10.1016/J.TCS.2017.09.034
description: scientific article; zbMATH DE number 6807605