Approximation Algorithms for Probabilistic Graphs
classification
💻 cs.DS
cs.NI
keywords
algorithmsapproximationgraphsprobabilisticproblemsanalyzecomparedexisting
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.