A parameterized approximation algorithm for the multiple allocation \(k\)-hub center
From MaRDI portal
Publication:6109001
DOI10.1007/978-3-031-20624-5_9arXiv2205.13030OpenAlexW4312894690MaRDI QIDQ6109001
Lehilton L. C. Pedrosa, Lucas P. Melo, Marcelo P. L. Benedito
Publication date: 26 July 2023
Published in: LATIN 2022: Theoretical Informatics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2205.13030
Algorithms in computer science (68Wxx) Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Geometric rounding: A dependent randomized rounding scheme
- Fixed-parameter approximations for \(k\)-center problems in low highway dimension graphs
- Stochastic air freight hub location and flight routes planning
- Approximation algorithms for the single allocation problem in hub-and-spoke networks and related metric labeling problems
- Clustering to minimize the maximum intercluster distance
- A quadratic integer program for the location of interacting hub facilities
- Treewidth. Computations and approximations
- On the single-assignment \(p\)-hub center problem
- Star \(p\)-hub center problem and star \(p\)-hub median problem with bounded path lengths
- A constant-factor approximation algorithm for the \(k\)-median problem
- The hardness and approximation of the star \(p\)-hub center problem
- \(\mathsf{W[1}\)-hardness of the \(k\)-center problem parameterized by the skeleton dimension]
- The parameterized hardness of the \(k\)-center problem in transportation networks
- An approximation algorithm for the \(p\)-hub median problem
- Structural parameters, tight bounds, and approximation for \((k, r)\)-center
- Approximation algorithms for median hub location problems
- Network hub location problems: The state of the art
- Tight FPT approximation for constrained \(k\)-center and \(k\)-supplier
- Approximation Algorithms for the Star k-Hub Center Problem in Metric Graphs
- Fixed-parameter algorithms for ( k , r )-center in planar graphs and map graphs
- The Design of Approximation Algorithms
- Algorithm for Single Allocation Problem on Hub-and-Spoke Networks in 2-Dimensional Plane
- A Best Possible Heuristic for the k-Center Problem
- Approximation Algorithms for the Set Covering and Vertex Cover Problems
- Parallel Algorithms with Optimal Speedup for Bounded Treewidth
- Airline network design and hub location problems
- Hub Location and the p-Hub Median Problem
- Parameterized Approximation Schemes Using Graph Widths
- Parameterized Algorithms
