Algorithm for Single Allocation Problem on Hub-and-Spoke Networks in 2-Dimensional Plane
From MaRDI portal
Publication:3104643
DOI10.1007/978-3-642-25591-5_49zbMath1350.68287OpenAlexW123184696MaRDI QIDQ3104643
Publication date: 16 December 2011
Published in: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-25591-5_49
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Approximation algorithms (68W25) Randomized algorithms (68W20)
Related Items (6)
Approximation Algorithm for Cycle-Star Hub Network Design Problems and Cycle-Metric Labeling Problems ⋮ A parameterized approximation algorithm for the multiple allocation \(k\)-hub center ⋮ Approximation algorithms for median hub location problems ⋮ A constant-ratio approximation algorithm for a class of hub-and-spoke network design problems and metric labeling problems: star metric case ⋮ Approximation Algorithm for Cycle-Star Hub Network Design Problems and Cycle-Metric Labeling Problems ⋮ Efficient algorithms for a simple network design problem
This page was built for publication: Algorithm for Single Allocation Problem on Hub-and-Spoke Networks in 2-Dimensional Plane
