Mutual exclusion scheduling with interval graphs or related classes: complexity and algorithms
From MaRDI portal
Publication:862816
DOI10.1007/s10288-005-0079-5zbMath1107.05033MaRDI 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
68Q25: Analysis of algorithms and problem complexity
68W40: Analysis of algorithms
68R10: Graph theory (including graph drawing) in computer science
90B35: Deterministic scheduling theory in operations research
05C15: Coloring of graphs and hypergraphs
Related Items
Selection of programme slots of television channels for giving advertisement: a graph theoretic approach, Mutual exclusion scheduling with interval graphs or related classes. I, Robust maximum weighted independent-set problems on interval graphs, Mutual exclusion scheduling with interval graphs or related classes. II, On partitioning interval graphs into proper interval subgraphs and related problems