The multi-service center problem

DOI10.1016/j.tcs.2017.09.034zbMath1380.90166OpenAlexW2764012768MaRDI QIDQ1680546

Cheng-Chung Li, Hung-I Yu, Der-Tsai Lee

Publication date: 16 November 2017

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2017.09.034

zbMATH Keywords

pathslocation theorytreesgeneral graphsdistinct servicesmulti-service location problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Discrete location and assignment (90B80) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items (1)

Complexity of the multi-service center problem

Cites Work

• Unnamed Item
• Unnamed Item
• A heuristic for the p-center problem in graphs
• An \(O(pn^ 2)\) algorithm for the \(p\)-median and related problems on tree graphs
• An Optimal Algorithm for the Continuous/Discrete Weighted 2-Center Problem in Trees
• Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
• Linear Programming in Linear Time When the Dimension Is Fixed
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• On the computational complexity of centers locating in a graph
• Slowing down sorting networks to obtain faster sorting algorithms
• Computing the 2‐median on tree networks in O(n lg n) time

This page was built for publication: The multi-service center problem