Composable core-sets for diversity and coverage maximization
In this paper we consider efficient construction of "composable core-sets" for basic diversity and coverage maximization problems. A core-set for a point-set in a metric space is a subset of the point-set with the property that an approximate solution to the whole point-set can be obtained...
Main Authors: | Indyk, Piotr (Contributor), Mahabadi, Sepideh (Contributor), Mahdian, Mohammad (Author), Mirrokni, Vahab S. (Author) |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor) |
Format: | Article |
Language: | English |
Published: |
Association for Computing Machinery,
2018-02-26T21:46:40Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
Composable core-sets for determinant maximization problems via spectral spanners
by: Indyk, Piotr
Published: (2021) -
Composable core-sets for determinant maximization: A simple near-optimal algorithm
by: Indyk, Piotr
Published: (2021) -
On Streaming and Communication Complexity of the Set Cover Problem
by: Demaine, Erik D., et al.
Published: (2015) -
Real-Time Recommendation of Diverse Related Articles
by: Indyk, Piotr, et al.
Published: (2014) -
Towards Tight Bounds for the Streaming Set Cover Problem
by: Har-Peled, Sariel, et al.
Published: (2018)