Scheduling in synchronous networks and the greedy algorithm

DOI10.1016/S0304-3975(98)00240-0zbMath0916.68064OpenAlexW1998682557MaRDI QIDQ1292430

Shmuel Zaks, King-Shan Lui

Publication date: 21 June 1999

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(98)00240-0

zbMATH Keywords

greedy algorithmsscheduling algorithmssynchronous networks

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (2)

Multicommodity flows over time: Efficient algorithms and complexity ⋮ Scheduling problems in transportation networks of line topology

Cites Work

• A Distributed Algorithm for Minimum-Weight Spanning Trees
• The virtual path layout problem in fast networks (extended abstract)
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Scheduling in synchronous networks and the greedy algorithm