Approximation Algorithms for the Star k-Hub Center Problem in Metric Graphs
From MaRDI portal
Publication:2817864
DOI10.1007/978-3-319-42634-1_18zbMath1477.68213OpenAlexW2486095455MaRDI QIDQ2817864
Dun-Wei Cheng, Sun-Yuan Hsieh, Chia-Wei Lee, Bang Ye Wu, Li-Hsuan Chen, Ling-Ju Hung
Publication date: 2 September 2016
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-42634-1_18
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 (7)
On the Complexity of the Star p-hub Center Problem with Parameterized Triangle Inequality ⋮ On the approximability of the single allocation \(p\)-hub center problem with parameterized triangle inequality ⋮ Approximability and inapproximability of the star \(p\)-hub center problem with parameterized triangle inequality ⋮ Hardness and approximation for the star \(p\)-hub routing cost problem in metric graphs ⋮ A parameterized approximation algorithm for the multiple allocation \(k\)-hub center ⋮ Approximation algorithms for median hub location problems ⋮ Approximation algorithms for the \(p\)-hub center routing problem in parameterized metric graphs
Cites Work
- Unnamed Item
- Unnamed Item
- A 2-phase algorithm for solving the single allocation \(p\)-hub center problem
- Uncapacitated single and multiple allocation \(p\)-hub center problems
- Integer programming formulations of discrete hub location problems
- On the single-assignment \(p\)-hub center problem
- Star \(p\)-hub center problem and star \(p\)-hub median problem with bounded path lengths
- The hardness and approximation of the star \(p\)-hub center problem
- Network hub location problems: The state of the art
- Analytical approach to parallel repetition
This page was built for publication: Approximation Algorithms for the Star k-Hub Center Problem in Metric Graphs
