平方度量的k层设施选址问题的近似算法

Approximation Algorithms for the Squared Metric k-Level Facility Location Problem

本文中,我们研究平方度量的k层设施选址问题,该问题中设施分为k层,每个顾客都要连接到位于不同层上的k个设施,顾客与设施以及设施与设施之间的距离是平方度量的.目标是使得开设费用与连接费用之和最小.基于线性规划舍入技巧,我们给出了9-近似算法.进一步,我们研究了平方度量的k层软容量设施选址问题,并给出了线性规划舍入12.2216-近似算法.

In this paper, we study the squared metric k-level facility location problem where the facilities are on k-level. The objective is to minimize the sum of the opening cost, the connection cost. Using the LP-rounding techniques, we then propose an approximation algorithm and obtain the approximation ratio of 9. Furthermore, we study the squared metric k-level soft capacitied facility location problem. Using the LP-rounding techniques, we then propose an approximation algorithm and obtain the approximation ratio of 12.2216.