Lower bounds for two call control problems

DOI10.1016/0020-0190(95)00147-5zbMath0875.68078OpenAlexW1990243623MaRDI QIDQ672266

Andrew Tomkins

Publication date: 28 February 1997

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(95)00147-5

zbMATH Keywords

AlgorithmsSchedulingCall control

Mathematics Subject Classification ID

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

Cites Work

• Efficient On-Line Call Control Algorithms
• Unnamed Item

This page was built for publication: Lower bounds for two call control problems