Publication:2921679
From MaRDI portal
zbMath1297.05174MaRDI QIDQ2921679
Miroslav Chlebík, Janka Chlebíková
Publication date: 13 October 2014
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
Related Items
Temporal interval cliques and independent sets, Minimum vertex cover in rectangle graphs, Competitive algorithms for multistage online scheduling, Scheduling split intervals with non-uniform demands