scientific article; zbMATH DE number 910914

zbMATH Open0851.68006MaRDI QIDQ4886091FDOQ4886091

Authors: Nabil Kahalé, Tom Leighton 

Publication date: 10 November 1996

Title of this publication is not available (Why is that?)

Recommendations

• Greedy Dynamic Routing on Arrays
• Greedy Packet Scheduling on Shortest Paths
• Concurrent threads and optimal parallel minimum spanning trees algorithm
• Bounds on the greedy routing algorithm for array networks
• Greedy Packet Scheduling

zbMATH Keywords

greedy algorithmsdynamic routing

Mathematics Subject Classification ID

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

Cited In (4)

• Average-case analysis of greedy packet scheduling (extended abstract)
• Constant time per edge is optimal on rooted tree networks
• Stochastic analysis of dynamic processes
• Greedy Dynamic Routing on Arrays

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4886091)