Complexity of the multi-service center problem

DOI10.1016/j.tcs.2020.07.021zbMath1460.68076OpenAlexW3046172180MaRDI QIDQ2006773

Naonori Kakimura, Yusuke Kobayashi, Takehiro Ito

Publication date: 12 October 2020

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

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2017/8253/

zbMATH Keywords

graph algorithmfacility locationmulti-service location

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Discrete location and assignment (90B80) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Clustering to minimize the maximum intercluster distance
• The multi-service center problem
• On distance matrices and Laplacians
• NP-completeness of st-orientations for plane graphs
• A Best Possible Heuristic for the k-Center Problem
• The Multi-Service Center Problem
• Complexity of the multi-service center problem

This page was built for publication: Complexity of the multi-service center problem