The median problem in the weighted Jaccard metric was analyzed by Späth in 1981. Up until now, only an exponential-time exact algorithm was known. We (a) obtain a PTAS for the weighted Jaccard median problem and (b) show that the problem does not admit a FPTAS (assuming P ≠ NP), even when restricted to binary vectors. The PTAS is built on a number of different algorithmic ideas and the hardness result makes use of an especially interesting gadget. Copyright © by SIAM.
Finding the Jaccard median / Chierichetti, Flavio; R., Kumar; Sandeep, Pandey; Sergei, Vassilvitskii. - (2010), pp. 293-311. ( 21st ACM-SIAM Symposium on Discrete Algorithms, SODA 010 Austin, Texas, USA January 17-19, 2010).
Finding the Jaccard median
CHIERICHETTI, FLAVIO;
2010
Abstract
The median problem in the weighted Jaccard metric was analyzed by Späth in 1981. Up until now, only an exponential-time exact algorithm was known. We (a) obtain a PTAS for the weighted Jaccard median problem and (b) show that the problem does not admit a FPTAS (assuming P ≠ NP), even when restricted to binary vectors. The PTAS is built on a number of different algorithmic ideas and the hardness result makes use of an especially interesting gadget. Copyright © by SIAM.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
