Efficient On-Line Call Control Algorithms
From MaRDI portal
Publication:3128992
DOI10.1006/jagm.1996.0821zbMath0866.68042OpenAlexW2081414879MaRDI QIDQ3128992
Inder S. Gopal, Yishay Mansour, Shay Kutten, Juan A. Garay, Mordechai M. 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
Network design and communication in computer systems (68M10) Parallel algorithms in computer science (68W10)
Related Items
A Randomized Algorithm for Online Scheduling with Interval Conflicts, On-line scheduling with hard deadlines, Online time-constrained scheduling in linear and ring networks, Competitive video on demand schedulers for popular movies, A Preemptive Algorithm for Maximizing Disjoint Paths on Trees, Improved bounds for randomized preemptive online matching, Scheduling to maximize participation, Lower bounds for two call control problems, On-line resource management with applications to routing and scheduling, Buyback Problem - Approximate Matroid Intersection with Cancellation Costs, A preemptive algorithm for maximizing disjoint paths on trees, Competitive routing of virtual circuits with unknown duration, Unnamed Item, Relaxing the irrevocability requirement for online graph algorithms, Competitive on-line scheduling of continuous-media streams
