scientific article; zbMATH DE number 1303572
From MaRDI portal
Publication:4250198
Recommendations
- On-line randomized call control revisited
- Efficient On-Line Call Control Algorithms
- Online call control in cellular networks revisited
- Deterministic on-line call control in cellular networks
- On-line routing of random calls in networks
- Distributed online call control on general networks
- Competitive algorithms and lower bounds for online randomized call control in cellular networks
Cited in
(15)- On-line routing of random calls in networks
- Scheduling multicasts on unit-capacity trees and meshes.
- Balanced routing of random calls
- Call admission problems on trees
- On-line randomized call control revisited
- Distributed online call control on general networks
- scientific article; zbMATH DE number 1003262 (Why is no real title available?)
- Efficient On-Line Call Control Algorithms
- A Preemptive Algorithm for Maximizing Disjoint Paths on Trees
- scientific article; zbMATH DE number 1347106 (Why is no real title available?)
- scientific article; zbMATH DE number 1559551 (Why is no real title available?)
- On-line competitive algorithms for call admission in optical networks
- On-line competitive algorithms for call admission in optical networks
- Lower bounds for two call control problems
- A preemptive algorithm for maximizing disjoint paths on trees
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 Q4250198)