摘要

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.

全文