Interval scheduling and colorful independent sets - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Journal Articles Journal of Scheduling Year : 2015

Interval scheduling and colorful independent sets


TheNP-hardIndependentSetproblemistodeterminefora 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 encoun- ters 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 prepro- cessing (kernelization) and fixed-parameter algorithms. Our algorithms benefit from novel formulations of the computational problems in terms of (list-)colored interval graphs.
Fichier principal
Vignette du fichier
interval-scheduling-and-colorful-independent-sets-isaac12.pdf (300.96 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

lirmm-01349213 , version 1 (27-07-2016)



René van Bevern, Matthias Mnich, Rolf Niedermeier, Mathias Weller. Interval scheduling and colorful independent sets. Journal of Scheduling, 2015, 18 (5), pp.449-469. ⟨10.1007/s10951-014-0398-5⟩. ⟨lirmm-01349213⟩
419 View
318 Download



Gmail Mastodon Facebook X LinkedIn More