The Complexity of File Transfer Scheduling with Forwarding
From MaRDI portal
Publication:3034813
DOI10.1137/0219015zbMath0692.68023OpenAlexW2071513795MaRDI QIDQ3034813
Publication date: 1990
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0219015
Graph theory (including graph drawing) in computer science (68R10) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Theory of software (68N99)
Related Items (2)
On the complexity of coordinated display of multimedia objects ⋮ ON SOLVING MULTIMESSAGE MULTICASTING PROBLEMS
This page was built for publication: The Complexity of File Transfer Scheduling with Forwarding