Greedy Packet Scheduling on Shortest Paths

DOI10.1006/jagm.1993.1024zbMath0780.90050OpenAlexW1998986058MaRDI QIDQ4696651

Yishay Mansour, Boaz Patt-Shamir

Publication date: 29 June 1993

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/6755fff76b586b85e09b742e299dac4aec38df37

zbMATH Keywords

greedy scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (5)

Scheduling problems in transportation networks of line topology ⋮ Networks on which hot-potato routing does not livelock ⋮ On the benefit of supporting virtual channels in wormhole routers ⋮ Adaptive packet routing for bursty adversarial traffic ⋮ Bounding Residence Times for Atomic Dynamic Routings

This page was built for publication: Greedy Packet Scheduling on Shortest Paths