@inproceedings{628abac57f36433d94bd5df575434e20,

title = "Interval Scheduling and Colorful Independent Sets",

abstract = "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.",

author = "{van Bevern}, Ren{\'e} and Matthias Mnich and Rolf Niedermeier and Mathias Weller",

year = "2012",

doi = "10.1007/978-3-642-35261-4_28",

language = "English",

isbn = "978-3-642-35260-7",

volume = "7676",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "247--256",

editor = "Kun-Mao Chao and Tsan-sheng Hsu and Der-Tsai Lee",

booktitle = "Algorithms and Computation",

address = "United States",

}