| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 435909 | Theoretical Computer Science | 2015 | 8 Pages |
Abstract
We study the calculation of the largest pairwise intersections in a given set family. We give combinatorial and algorithmic results both for the worst case and for set families where the frequencies of elements follow a power law, as words in texts typically do. The results can be used in faster preprocessing routines in a simple approach to multi-document summarization.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Peter Damaschke,