Published January 4, 2021
| Version v1
Journal article
Open
Polynomial Time Approximation Schemes for All 1-Center Problems on Metric Rational Set Similarities
Description
In this paper, we investigate algorithms for finding centers of a given collection N of sets. In particular, we focus on metric rational set similarities, a broad class of similarity measures including Jaccard and Hamming. A rational set similarity S is called metric if D=1-S is a distance function. We study the 1-center problem on these metric spaces. The problem consists of finding a set C that minimizes the maximum distance of C to any set of N. We present a general framework that computes a (1+๐) approximation for any metric rational set similarity.
Files
Bury2021_Article_PolynomialTimeApproximationSch.pdf
Files
(2.5 MB)
Name | Size | Download all |
---|---|---|
md5:1e76c2c769f7acbefd94cfa3e6b459af
|
2.5 MB | Preview Download |