Complexity of the multi-service center problem

DOI10.1016/J.TCS.2020.07.021MaRDI QIDQ2006773zbMATH OpenOpenAlexFDO

Authors Takehiro Ito, Naonori Kakimura, Yusuke Kobayashi

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

facility locationgraph algorithmmulti-service location

Mathematics Subject Classification ID

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

Recommendations

• Complexity of the multi-service center problem
• The multi-service center problem
• The multi-service center problem
• On alternativep-center problems
• The k-centrum multi-facility location problem

Cites work

• A Best Possible Heuristic for the k-Center Problem
• Clustering to minimize the maximum intercluster distance
• Complexity of the multi-service center problem
• scientific article; zbMATH DE number 4089320 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1746287 (Why is no real title available?)
• NP-completeness of st-orientations for plane graphs
• On distance matrices and Laplacians
• The multi-service center problem
• The multi-service center problem

Cited in

(5)

• The multi-service center problem
• The multi-service center problem
• Complexity of the multi-service center problem
• The multi-hour service system design problem
• Algorithms and time complexity of the request-service problem

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

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