A combinatorial approximation algorithm for k-level facility location problem with submodular penalties
Li Zhang,
Jing Yuan,
Zhizhen Xu and
Qiaoliang Li ()
Additional contact information
Li Zhang: Hunan Normal University
Jing Yuan: Hunan Normal University
Zhizhen Xu: Hunan Normal University
Qiaoliang Li: Hunan Normal University
Journal of Combinatorial Optimization, 2023, vol. 46, issue 1, No 5, 19 pages
Abstract:
Abstract We present an improved approximation algorithm for k-level facility location problem with submodular penalties, the new approximation ratio is 2.9444 for any constant k, which improves the current best approximation ratio 3.314. The central ideas in our results are as follows: first, we restructure the problem as an uncapacitated facility location problem, then we use the primal-dual scheme with greedy augmentation. The key technique of our result is that we change the way of last opening facility set in primal-dual approximation algorithm to get much more tight result for k-level facility location problem with submodular penalties.
Keywords: Submodular penalties; Greedy augmentation; Primal-dual; k-level facility location problem; 90C27; 90C10 (search for similar items in EconPapers)
Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)
Downloads: (external link)
http://link.springer.com/10.1007/s10878-023-01067-w Abstract (text/html)
Access to the full text of the articles in this series is restricted.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:46:y:2023:i:1:d:10.1007_s10878-023-01067-w
Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878
DOI: 10.1007/s10878-023-01067-w
Access Statistics for this article
Journal of Combinatorial Optimization is currently edited by Thai, My T.
More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().