Constant approximation for fault-tolerant median problems via iterative rounding

05/10/2022

∙

by   Shichuan Deng, et al.

∙

0

∙

share

In this paper, we study the fault-tolerant matroid median and fault-tolerant knapsack median problems. These two problems generalize many fundamental clustering and facility location problems, such as uniform fault-tolerant k-median, uniform fault-tolerant facility location, matroid median, knapsack median, etc. We present a versatile iterative rounding framework and obtain a unifying constant-factor approximation algorithm.