Local-search based approximation algorithms for mobile facility location problems (extended abstract)

DOI10.1137/1.9781611973105.115MaRDI QIDQ5741824zbMATH OpenOpenAlexFDO

Authors Sara Ahmadian, Zachary Friggstad, Chaitanya Swamy

Publication date 15 May 2019

Published in Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1301.4478

Mathematics Subject Classification ID

Approximation algorithms (68W25) Continuous location (90B85) Approximation methods and heuristics in mathematical programming (90C59)

Abstract: We consider the {em mobile facility location} (mfl) problem. We are given a set of facilities and clients located in a common metric space. The goal is to move each facility from its initial location to a destination and assign each client to the destination of some facility so as to minimize the sum of the movement-costs of the facilities and the client-assignment costs. This abstracts facility-location settings where one has the flexibility of moving facilities from their current locations to other destinations so as to serve clients more efficiently by reducing their assignment costs. We give the first {em local-search based} approximation algorithm for this problem and achieve the best-known approximation guarantee. Our main result is $(3+epsilon)$-approximation for this problem for any constant $epsilon>0$ using local search. The previous best guarantee was an 8-approximation algorithm based on LP-rounding. Our guarantee {em matches} the best-known approximation guarantee for the $k$-median problem. Since there is an approximation-preserving reduction from the $k$-median problem to mfl, any improvement of our result would imply an analogous improvement for the $k$-median problem. Furthermore, {em our analysis is tight} (up to $o(1)$ factors) since the tight example for the local-search based 3-approximation algorithm for $k$-median can be easily adapted to show that our local-search algorithm has a tight approximation ratio of 3. One of the chief novelties of the analysis is that in order to generate a suitable collection of local-search moves whose resulting inequalities yield the desired bound on the cost of a local-optimum, we define a tree-like structure that (loosely speaking) functions as a "recursion tree", using which we spawn off local-search moves by exploring this tree to a constant depth.

Recommendations

• Minimizing movement in mobile facility location problems
• Local search heuristics for the mobile facility location problem
• Local Search Heuristics for k-Median and Facility Location Problems
• Local search heuristic for k-median and facility location problems
• scientific article; zbMATH DE number 1303535

Cited in

(13)

• The capacitated mobile facility location problem
• Facility reallocation on the line
• Approximation algorithms for clustering with dynamic points
• Mobile facility location: combinatorial filtering via weighted occupancy
• Minimizing movement in mobile facility location problems
• Local search heuristics for the mobile facility location problem
• Approximation algorithms for distributed multi-robot coverage in non-convex environments
• Exact and approximate algorithms for movement problems on (special classes of) graphs
• A local-search algorithm for Steiner forest
• Network movement games
• Approximation algorithms for clustering with dynamic points
• scientific article; zbMATH DE number 7765379 (Why is no real title available?)
• Constant-factor approximation algorithms for parity-constrained facility location and \(k\)-center

This page was built for publication: Local-search based approximation algorithms for mobile facility location problems (extended abstract)

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