Interval scheduling and colorful independent sets
Year of publication: |
2015
|
---|---|
Authors: | Van Bevern, René ; Mnich, Matthias ; Niedermeier, Rolf ; Weller, Mathias |
Published in: |
Journal of scheduling. - New York, NY : Springer Science + Business Media LLC, ISSN 1094-6136, ZDB-ID 1492486-9. - Vol. 18.2015, 5, p. 449-469
|
Subject: | Interval graphs | 2-union graphs | Strip graphs | Job interval selection | Parameterized complexity | Graphentheorie | Graph theory | Scheduling-Verfahren | Scheduling problem | Deskriptive Statistik | Descriptive statistics |
-
Inductive k-independent graphs and c-colorable subgraphs in scheduling : a review
Bentert, Matthias, (2019)
-
Inverse chromatic number problems in interval and permutation graphs
Chung, Yerim, (2015)
-
Approximation algorithms for job scheduling with block-type conflict graphs
Furmańczyk, Hanna, (2024)
- More ...
-
Van Bevern, René, (2017)
-
Inductive k-independent graphs and c-colorable subgraphs in scheduling : a review
Bentert, Matthias, (2019)
-
Bentert, Matthias, (2022)
- More ...