Dynamic Facility Location via Exponential Clocks

DOI10.1145/2928272zbMath1451.90084arXiv1411.4476OpenAlexW3161451740WikidataQ115522543 ScholiaQ115522543MaRDI QIDQ4962653

Ashkan Norouzi-Fard, Ola Svensson, Hyung-Chan An

Publication date: 5 November 2018

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

approximation algorithmsfacility location problemsexponential clocks

Mathematics Subject Classification ID

Linear programming (90C05) Discrete location and assignment (90B80) Approximation algorithms (68W25)

Related Items (13)

Multistage knapsack ⋮ Approximation algorithms for clustering with dynamic points ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Reallocating multiple facilities on the line ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Online multistage subset maximization problems ⋮ Unnamed Item ⋮ A simple rounding scheme for multistage optimization ⋮ Target-based computer-assisted orchestration: complexity and approximation algorithms ⋮ Facility reallocation on the line ⋮ LP-based algorithms for multistage minimization problems

This page was built for publication: Dynamic Facility Location via Exponential Clocks