The approximability of the \(p\)-hub center problem with parameterized triangle inequality
From MaRDI portal
Publication:2412404
DOI10.1007/978-3-319-62389-4_10zbMath1382.68163OpenAlexW2728689850MaRDI QIDQ2412404
Li-Hsuan Chen, Sun-Yuan Hsieh, Ralf Klasing, Ling-Ju Hung
Publication date: 23 October 2017
Full work available at URL: https://doi.org/10.1007/978-3-319-62389-4_10
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Related Items (4)
Improved hardness and approximation results for single allocation hub location problems ⋮ A Modern View on Stability of Approximation ⋮ Approximation algorithms for the \(p\)-hub center routing problem in parameterized metric graphs ⋮ Improved hardness and approximation results for single allocation hub location
This page was built for publication: The approximability of the \(p\)-hub center problem with parameterized triangle inequality
