Interval Scheduling and Colorful Independent Sets

René van Bevern, Matthias Mnich, Rolf Niedermeier, Mathias Weller

Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingAcademicpeer-review


The np-hard independent set problem is to determine for a given graph g and an integer k whether g contains a set of k pairwise non-adjacent vertices. The problem has numerous applications in scheduling, including resource allocation and steel manufacturing. There, one encounters restricted graph classes such as 2-union graphs, which are edge-wise unions of two interval graphs on the same vertex set, or strip graphs, where additionally one of the two interval graphs is a disjoint union of cliques.we prove np-hardness of independent set on a very restricted subclass of 2-union graphs and identify natural parameterizations to chart the possibilities and limitations of effective polynomial-time preprocessing (kernelization) and fixed-parameter algorithms. Our algorithms benefit from novel formulations of the computational problems in terms of (list-)colored interval graphs.
Original languageEnglish
Title of host publicationAlgorithms and Computation
Subtitle of host publication23rd International Symposium, ISAAC 2012, Taipei, Taiwan, December 2012 Proceedings
EditorsKun-Mao Chao, Tsan-sheng Hsu, Der-Tsai Lee
ISBN (Electronic)978-3-642-35261-4
ISBN (Print)978-3-642-35260-7
Publication statusPublished - 2012
Externally publishedYes

Publication series

SeriesLecture Notes in Computer Science

Cite this