2011 | OriginalPaper | Chapter
Algorithm for Single Allocation Problem on Hub-and-Spoke Networks in 2-Dimensional Plane
Authors : Ryuta Ando, Tomomi Matsui
Published in: Algorithms and Computation
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
This paper deals with a single allocation problem in hub-and-spoke networks. We handle the case that all the nodes are embedded in a 2-dimensional plane and a transportation cost (per unit flow) is proportional to Euclidean distance. We propose a randomized (1 + 2/
π
)-approximation algorithm based on a linear relaxation problem and a dependent rounding procedure.