Mutual exclusion scheduling with interval graphs or related classes: complexity and algorithms
From MaRDI portal
Publication:862816
DOI10.1007/s10288-005-0079-5zbMath1107.05033OpenAlexW1997985693MaRDI QIDQ862816
Publication date: 24 January 2007
Published in: 4OR (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10288-005-0079-5
Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Deterministic scheduling theory in operations research (90B35) Coloring of graphs and hypergraphs (05C15)
Related Items (6)
On partitioning interval graphs into proper interval subgraphs and related problems ⋮ Selection of programme slots of television channels for giving advertisement: a graph theoretic approach ⋮ Robust maximum weighted independent-set problems on interval graphs ⋮ Mutual exclusion scheduling with interval graphs or related classes. II ⋮ Scheduling algorithm to select optimal programme slots in television channels: a graph theoretic approach ⋮ Mutual exclusion scheduling with interval graphs or related classes. I
This page was built for publication: Mutual exclusion scheduling with interval graphs or related classes: complexity and algorithms
