Pages that link to "Item:Q1292430"
From MaRDI portal
The following pages link to Scheduling in synchronous networks and the greedy algorithm (Q1292430):
Displaying 10 items.
- Enhancing self-scheduling algorithms via synchronization and weighting (Q436689) (← links)
- Competitive analysis of scheduling algorithms for aggregated links (Q930606) (← links)
- Scheduling in multiclass networks with deterministic service times (Q1611751) (← links)
- Scheduling time-constrained communication in linear networks (Q1871771) (← links)
- Scheduling policies using marked/phantom slot algorithms (Q1906875) (← links)
- Multicommodity flows over time: Efficient algorithms and complexity (Q2373727) (← links)
- Scheduling problems in transportation networks of line topology (Q2448158) (← links)
- Scheduling in the presence of processor networks : complexity and approximation (Q2893338) (← links)
- Link scheduling in polynomial time (Q3826350) (← links)
- Optimizing concurrency under Scheduling by Edge Reversal (Q6087133) (← links)