Facility Location in Evolving Metrics

DOI10.1007/978-3-662-43951-7_39zbMath1410.90116arXiv1403.6758OpenAlexW1639167359MaRDI QIDQ5167860

Claire Mathieu, Nicolas Schabanel, David Eisenstat

Publication date: 1 July 2014

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Deterministic network models in operations research (90B10) Discrete location and assignment (90B80) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items (22)

Multistage knapsack ⋮ Multistage graph problems on a global budget ⋮ Multistage vertex cover ⋮ Approximation algorithms for clustering with dynamic points ⋮ Multistage robust discrete optimization via quantified integer programming ⋮ Constant-factor approximation algorithms for parity-constrained facility location and \(k\)-center ⋮ Multistage \(s-t\) path: confronting similarity with dissimilarity ⋮ Unnamed Item ⋮ A multistage view on 2-satisfiability ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Dynamic Sum-Radii Clustering ⋮ Reallocating multiple facilities on the line ⋮ Multistage s-t Path: Confronting Similarity with Dissimilarity in Temporal Graphs ⋮ 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: Facility Location in Evolving Metrics