Approximation algorithms for the dynamic \(k\)-level facility location problems

DOI10.1016/j.tcs.2020.05.022zbMath1478.68451OpenAlexW2966432004MaRDI QIDQ2220850

Zhao Zhang, Xiaoyan Zhang, Da-Chuan Xu, Chen-Chen Wu, Li-Min Wang

Publication date: 25 January 2021

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2020.05.022

zbMATH Keywords

outliersapproximation algorithmprimal-dualdynamic facility locationsubmodular penalties

Mathematics Subject Classification ID

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

Related Items (2)

Strategyproof facility location with limited locations ⋮ The facility location problem with maximum distance constraint

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An approximation algorithm for the dynamic facility location problem with submodular penalties
• An approximation algorithm for the \(k\)-level capacitated facility location problem
• Forecast horizons and dynamic facility location planning
• A branch-and-bound algorithm for the multi-level uncapacitated facility location problem
• A push-relabel framework for submodular function minimization and applications to parametric optimization
• A 3-approximation algorithm for the \(k\)-level uncapacitated facility location problem
• An improved approximation algorithm for the \(k\)-level facility location problem with soft capacities
• Improved approximation algorithms for multilevel facility location problems
• Erratum to: ``An approximation algorithm for the \(k\)-level stochastic facility location problem
• An approximation algorithm for the dynamic facility location problem with outliers
• A primal-dual approximation algorithm for the facility location problem with submodular penalties
• The \(k\)-level facility location game
• Improved LP-Rounding Approximation Algorithm for k-level Uncapacitated Facility Location
• Approximation Algorithms for the Multilevel Facility Location Problem with Linear/Submodular Penalties
• Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
• A Dual-Based Procedure for Dynamic Facility Location
• Greedy Strikes Back: Improved Facility Location Algorithms
• Local Search Heuristics for k-Median and Facility Location Problems
• Improved Combinatorial Approximation Algorithms for the k-Level Facility Location Problem

This page was built for publication: Approximation algorithms for the dynamic \(k\)-level facility location problems