Approximation Algorithms for Probabilistic Graphs

07/03/2018

∙

by   Kai Han, et al.

∙

0

∙

share

We study the k-median and k-center problems in probabilistic graphs. We analyze the hardness of these problems, and propose several algorithms with improved approximation ratios compared with the existing proposals.