Pages that link to "Item:Q2464395"
From MaRDI portal
The following pages link to Scheduling with conflicts on bipartite and interval graphs (Q2464395):
Displayed 7 items.
- Backup 2-center on interval graphs (Q442280) (← links)
- The \(p\)-Maxian problem on interval graphs (Q608284) (← links)
- Scheduling with conflicts: Online and offline algorithms (Q842559) (← links)
- The interval-merging problem (Q867634) (← links)
- An improved algorithm for the \(p\)-center problem on interval graphs with unit lengths (Q868984) (← links)
- Non-clairvoyant scheduling with conflicts for unit-size jobs (Q1721929) (← links)
- An exact algorithm for parallel machine scheduling with conflicts (Q2400043) (← links)