Algorithm for single allocation problem on hub-and-spoke networks in 2-dimensional plane

DOI10.1007/978-3-642-25591-5_49zbMATH Open1350.68287OpenAlexW123184696MaRDI QIDQ3104643FDOQ3104643

Authors: Ryuta Ando, Tomomi Matsui 

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

Recommendations

• Approximation algorithms for the single allocation problem in hub-and-spoke networks and related metric labeling problems
• An improved algorithm for fixed-hub single allocation problems
• Allocation strategies in hub networks
• Approximation Algorithm for Cycle-Star Hub Network Design Problems and Cycle-Metric Labeling Problems
• The single allocation problem in the interacting three-hub network

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Randomized algorithms (68W20) Deterministic network models in operations research (90B10) Approximation algorithms (68W25)

Cited In (8)

• A parameterized approximation algorithm for the multiple allocation \(k\)-hub center
• Approximation algorithm for cycle-star hub network design problems and cycle-metric labeling problems
• An improved algorithm for fixed-hub single allocation problems
• Approximation algorithms for the single allocation problem in hub-and-spoke networks and related metric labeling problems
• Efficient algorithms for a simple network design problem
• Approximation algorithms for median hub location problems
• Approximation Algorithm for Cycle-Star Hub Network Design Problems and Cycle-Metric Labeling Problems
• A constant-ratio approximation algorithm for a class of hub-and-spoke network design problems and metric labeling problems: star metric case

This page was built for publication: Algorithm for single allocation problem on hub-and-spoke networks in 2-dimensional plane

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