Scheduling in synchronous networks and the greedy algorithm
From MaRDI portal
(Redirected from Publication:1292430)
Recommendations
Cites work
- scientific article; zbMATH DE number 4215340 (Why is no real title available?)
- scientific article; zbMATH DE number 108110 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A Distributed Algorithm for Minimum-Weight Spanning Trees
- The virtual path layout problem in fast networks (extended abstract)
Cited in
(13)- Greedy Packet Scheduling
- Multicommodity flows over time: Efficient algorithms and complexity
- Enhancing self-scheduling algorithms via synchronization and weighting
- Scheduling in multiclass networks with deterministic service times
- Link scheduling in polynomial time
- Scheduling policies using marked/phantom slot algorithms
- Scheduling in the presence of processor networks : complexity and approximation
- Greedy Packet Scheduling on Shortest Paths
- Scheduling problems in transportation networks of line topology
- Optimizing concurrency under Scheduling by Edge Reversal
- Scheduling time-constrained communication in linear networks
- Scheduling periodic messages on a shared link without buffering
- Competitive analysis of scheduling algorithms for aggregated links
This page was built for publication: Scheduling in synchronous networks and the greedy algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1292430)