A combinatorial 2.375-approximation algorithm for the facility location problem with submodular penalties
From MaRDI portal
Publication:1945937
DOI10.1016/j.tcs.2012.11.037zbMath1292.90253OpenAlexW2025143052MaRDI QIDQ1945937
Yu Li, Dong-lei Du, Nai-Hua Xiu, Da-Chuan Xu
Publication date: 17 April 2013
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.11.037
Related Items (4)
An approximation algorithm for submodular hitting set problem with linear penalties ⋮ A combinatorial approximation algorithm for \(k\)-level facility location problem with submodular penalties ⋮ A per-scenario bound for the two-stage stochastic facility location problem with linear penalty ⋮ Improved approximation algorithms for the facility location problems with linear/submodular penalties
This page was built for publication: A combinatorial 2.375-approximation algorithm for the facility location problem with submodular penalties
