TU Berlin

Research Group Algorithmics and Computational ComplexityTalk 22.01.2015

isti-logo

Page Content

to Navigation

Multicover by c-intervals

Dr. rer. nat. René van Bevern (TU Berlin)

A c-interval is a collection of c disjoint intervals over N. Set Multicover is a generalization of the classical Set Cover problem in which each element i has to be covered d(i) times instead of only once.
c-Interval Multicover, in turn, is the special case of Set Multicover where all sets available for covering are c-intervals.  The talk presents recent results about the approximation and parameterized complexity of c-Interval Multicover.

Date
Speaker
Location
Language
22.01.2015
16:15
René van Bevern
TEL 512
english

Back to the research colloquium site.

Navigation

Quick Access

Schnellnavigation zur Seite über Nummerneingabe