Approximation algorithms for Median Hub Location Problems
- 16 Downloads
In Hub Location Problems, an input is composed of sets of clients, locations and a pairs of clients; a solution is a subset of locations to open hubs and an assignment for each pair of clients to a route starting in the first client, passing through one or more hubs and ending in the second client. The objective is to find a solution that minimizes the length of all routes plus the cost of opening hubs. The currently known approximation algorithms consider only the case in which the set of hubs is given as part of the input and the problem is assigning clients to hubs. For a metric space setting, this work presents the first constant-factor approximation algorithms for the problem of, simultaneously, selecting hubs and allocating clients. A few variants are considered, depending on whether the number of open hubs is given in the input or a client must be assigned to a single hub. In particular, we give an LP-rounding \(2.48\)-approximation algorithm for the Single-Allocation Median Hub Location Problem, using a new formulation and exploiting its symmetries.
KeywordsApproximation algorithm Hub Location Problem LP-rounding
- Ando R, Matsui T (2011) Algorithm for single allocation problem on hub-and-spoke networks in 2-dimensional plane. In: Algorithms and computation, pp 474–483Google Scholar
- Byrka J, Pensyl T, Rybicki B, Srinivasan A, Trinh K (2014) An improved approximation for \(k\)-median, and positive correlation in budgeted optimization. In: Proceedings of the twenty-sixth annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, pp 737–756Google Scholar