An approximation algorithm for the $k$-level facility location problem with submodular penalties

Autor:	Zhen Wang, Dachuan Xu, Gaidi Li
Rok vydání:	2012
Předmět:	Control and Optimization Computer science Applied Mathematics Strategy and Management Maximum coverage problem TheoryofComputation_GENERAL Approximation algorithm Business and International Management Combinatorial algorithms Algorithm Facility location problem Submodular set function Primal dual
Zdroj:	Journal of Industrial and Management Optimization. 8:521-529
ISSN:	1547-5816
DOI:	10.3934/jimo.2012.8.521
Popis:	In this paper, we consider the $k$-level facility location problem with submodular penalties ($k$-FLPSP). We propose a primal-dual $6$-approximation (combinatorial) algorithm for the $k$-FLPSP.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::530264b4bf9058687e5935aa428157cc https://doi.org/10.3934/jimo.2012.8.521 Zobrazit plný text záznamu