Scheduling with conflicts on bipartite and interval graphs
From MaRDI portal
Publication:2464395
DOI10.1023/A:1022908509269zbMath1154.90460MaRDI QIDQ2464395
Publication date: 20 December 2007
Published in: Journal of Scheduling (Search for Journal in Brave)
90B35: Deterministic scheduling theory in operations research
Related Items
Backup 2-center on interval graphs, The \(p\)-Maxian problem on interval graphs, Scheduling with conflicts: Online and offline algorithms, The interval-merging problem, An improved algorithm for the \(p\)-center problem on interval graphs with unit lengths