Inductive k-independent graphs and c-colorable subgraphs in scheduling : a review
Year of publication: |
2019
|
---|---|
Authors: | Bentert, Matthias ; Van Bevern, René ; Niedermeier, Rolf |
Published in: |
Journal of scheduling. - New York, NY : Springer Science + Business Media LLC, ISSN 1094-6136, ZDB-ID 1492486-9. - Vol. 22.2019, 1, p. 3-20
|
Subject: | Independent set | Job interval selection | Interval graphs | Chordal graphs | Inductive k-independent graphs | NP-hard problems | Parameterized complexity | Graphentheorie | Graph theory | Scheduling-Verfahren | Scheduling problem | Deskriptive Statistik | Descriptive statistics |
-
Interval scheduling and colorful independent sets
Van Bevern, René, (2015)
-
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 ...
-
Bentert, Matthias, (2022)
-
A multivariate complexity analysis of the material consumption scheduling problem
Bentert, Matthias, (2023)
-
A multivariate complexity analysis of the material consumption scheduling problem
Bentert, Matthias, (2023)
- More ...