Refined algorithms for hitting many intervals
Journal article, 2017

Within a study of scheduling problems with gaps, Chrobak et al. (CIAC 2015) have shown how to find k points on the line that hit a maximum number of intervals, in a given family of n intervals, The problem is equivalent to finding k cliques in an interval graph that cover a maximum number of distinct vertices. We give refined algorithms that run faster if the interval graph of the family is sparse.

dynamic programming

scheduling with gaps

hitting set

interval graph

sparse graph


Peter Damaschke

Chalmers, Computer Science and Engineering (Chalmers), Computing Science (Chalmers)

Information Processing Letters

0020-0190 (ISSN)

Vol. 118 117-122


Basic sciences

Subject Categories

Computer Science

Discrete Mathematics



More information