Efficient On-Line Call Control Algorithms
From MaRDI portal
Publication:3128992
DOI10.1006/JAGM.1996.0821zbMATH Open0866.68042OpenAlexW2081414879MaRDI QIDQ3128992FDOQ3128992
Authors: Juan Garay, Inder S. Gopal, Shay Kutten, Yishay Mansour, Moti Yung 
Publication date: 27 April 1997
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/f2446995424c65130637102c4231ac45eff1032a
Recommendations
- scientific article; zbMATH DE number 1303572
- Approximation and Online Algorithms
- Deterministic on-line call control in cellular networks
- Online call control in cellular networks revisited
- Distributed online call control on general networks
- Efficient on-line frequency allocation and call control in cellular networks
- Deterministic online call control in cellular networks and triangle-free cellular networks
- On optimal call admission control in resource-sharing system
- Competitive algorithms and lower bounds for online randomized call control in cellular networks
Parallel algorithms in computer science (68W10) Network design and communication in computer systems (68M10)
Cited In (24)
- Title not available (Why is that?)
- On-line resource management with applications to routing and scheduling
- Competitive on-line scheduling of continuous-media streams
- Competitive routing of virtual circuits with unknown duration
- Competitive video on demand schedulers for popular movies
- A preemptive algorithm for maximizing disjoint paths on trees
- Title not available (Why is that?)
- A randomized algorithm for online scheduling with interval conflicts
- Any-order online interval selection
- Distributed online call control on general networks
- Improved bounds for randomized preemptive online matching
- Call control with \(k\) rejections
- Routing and call control algorithms for ring networks.
- A Preemptive Algorithm for Maximizing Disjoint Paths on Trees
- Beating the logarithmic lower bound: randomized preemptive disjoint paths and call control algorithms
- On-line randomized call control revisited
- Online time-constrained scheduling in linear and ring networks
- Title not available (Why is that?)
- On-line scheduling with hard deadlines
- Scheduling to maximize participation
- Title not available (Why is that?)
- Buyback problem -- approximate matroid intersection with cancellation costs
- Call Control with k Rejections
- Lower bounds for two call control problems
This page was built for publication: Efficient On-Line Call Control Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3128992)
