Local-Search based Approximation Algorithms for Mobile Facility Location Problems: (Extended Abstract)

DOI10.1137/1.9781611973105.115zbMath1422.90020arXiv1301.4478OpenAlexW2499461890MaRDI QIDQ5741824

Sara Ahmadian, Chaitanya Swamy, Zachary Friggstad

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

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

Related Items (10)

Exact and approximate algorithms for movement problems on (special classes of) graphs ⋮ Approximation algorithms for clustering with dynamic points ⋮ Constant-factor approximation algorithms for parity-constrained facility location and \(k\)-center ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A Local-Search Algorithm for Steiner Forest ⋮ The capacitated mobile facility location problem ⋮ Network movement games ⋮ Approximation Algorithms for Distributed Multi-robot Coverage in Non-convex Environments ⋮ Facility reallocation on the line

This page was built for publication: Local-Search based Approximation Algorithms for Mobile Facility Location Problems: (Extended Abstract)