Pages that link to "Item:Q2819592"
From MaRDI portal
The following pages link to Approximating the throughput of multiple machines under real-time scheduling (Q2819592):
Displaying 5 items.
- Online real-time preemptive scheduling of jobs with deadlines on multiple machines (Q1348736) (← links)
- The lazy bureaucrat scheduling problem (Q1398377) (← links)
- Aligning two fragmented sequences (Q1868717) (← links)
- Maximum max-k-clique subgraphs in cactus subtree graphs (Q6132893) (← links)
- Approximations for Throughput Maximization (Q6492088) (← links)
