Mobile facility location: Combinatorial filtering via weighted occupancy

Amitai Armon, Iftah Gamzu, Danny Segev

Research output: Contribution to journalArticlepeer-review

Abstract

An instance of the mobile facility location problem consists of a complete directed graph G = (V, E), in which each arc (u, v)E is associated with a numerical attribute M (u,v), representing the cost of moving any object from u to v. An additional ingredient of the input is a collection of servers S ={s1⋯sk } and a set of clients C = { c1,⋯, cl }, which are located at nodes of the underlying graph. With this setting in mind, a movement scheme is a function ψ: S V that relocates each server sito a new position, ψ (si). We refer to M (s i,(si) as the relocation cost of si, and to min i [k]M (cj,(si), the cost of assigning client c j to the nearest final server location, as the service cost of c j. The objective is to compute a movement scheme that minimizes the sum of relocation and service costs. In this paper, we resolve an open question posed by Demaine et al. (SODA '07) by characterizing the approximability of mobile facility location through LP-based methods. We also develop a more efficient algorithm, which is based on a combinatorial filtering approach. The latter technique is of independent interest, as it may be applicable in other settings as well. In this context, we introduce a weighted version of the occupancy problem, for which we establish interesting tail bounds, not before demonstrating that existing bounds cannot be extended.

Original languageEnglish
Pages (from-to)358-375
Number of pages18
JournalJournal of Combinatorial Optimization
Volume28
Issue number2
DOIs
StatePublished - Aug 2014
Externally publishedYes

Keywords

  • Approximation algorithms
  • Filtering
  • Movement problems
  • Non-metric facility location
  • Occupancy problem

Fingerprint

Dive into the research topics of 'Mobile facility location: Combinatorial filtering via weighted occupancy'. Together they form a unique fingerprint.

Cite this