Calculating approximation guarantees for partial set cover of pairs
Artikel i vetenskaplig tidskrift, 2017

As a part of a heuristic for the fast detection of new word combinations in text streams, we consider the NP-hard Partial Set Cover of Pairs problem. There we wish to cover a maximum number of pairs of elements by a prescribed number of sets from a given set family. While the approximation ratio of the greedy algorithm for the classic Partial Set Cover problem is completely understood, the same question for covering of pairs is intrinsically more complicated, since the pairs insert some graph-theoretic structure. The best approximation guarantee for the first greedy step can be rephrased as a problem in extremal combinatorics: Assume that we may place a fixed number of subsets of fixed and equal size in a set, how many different pairs of elements can we cover? In this paper we introduce a method to calculate optimal approximation guarantees, and we demonstrate its use on the smallest set families.

greedy approximation

partial set cover

novelty detection

extremal set family


Peter Damaschke

Chalmers, Data- och informationsteknik, Datavetenskap

Optimization Letters

1862-4472 (ISSN) 1862-4480 (eISSN)

Vol. 11 1293-1302



Diskret matematik


Grundläggande vetenskaper