Publication:3128890
From MaRDI portal
zbMath0876.68047MaRDI QIDQ3128890
Baruch Awerbuch, Adi Rosén, Amos Fiat, Yair Bartal
Publication date: 23 April 1997
68W10: Parallel algorithms in computer science
Related Items
On-line routing in all-optical networks, On-line resource management with applications to routing and scheduling, On-line scheduling with hard deadlines, Adaptive Video on Demand, Length-Weighted Disjoint Path Allocation, Weighted Maximum Independent Set of Geometric Objects in Turnstile Streams., Online scheduling of jobs with fixed start times on related machines, Online scheduling with interval conflicts, Online selection of intervals and \(t\)-intervals, On-line scheduling of equal-length intervals on parallel machines, Online scheduling of weighted equal-length jobs with hard deadlines on parallel machines, Lower bounds for two call control problems, Randomized on-line algorithms and lower bounds for computing large independent sets in disk graphs, Scheduling to maximize participation, A preemptive algorithm for maximizing disjoint paths on trees, Deterministic on-line call control in cellular networks, Online interval scheduling: Randomized and multiprocessor cases, Efficient delay routing, Competitive video on demand schedulers for popular movies, Scheduling multicasts on unit-capacity trees and meshes., Competitive on-line scheduling of continuous-media streams, Scheduling multipacket frames with frame deadlines, On-line routing in all-optical networks, Improved randomized online scheduling of intervals and jobs, Online algorithms for maximizing weighted throughput of unit jobs with temperature constraints, Online scheduling of bounded length jobs to maximize throughput, Admission control with advance reservations in simple networks, Call admission problems on trees, An Improved Online Algorithm for the Online Preemptive Scheduling of Equal-Length Intervals on a Single Machine with Lookahead, Online Algorithms for Maximizing Weighted Throughput of Unit Jobs with Temperature Constraints, Disjoint Path Allocation with Sublinear Advice, Scheduling Multipacket Frames with Frame Deadlines, A Randomized Algorithm for Online Scheduling with Interval Conflicts, A Preemptive Algorithm for Maximizing Disjoint Paths on Trees, Competitive algorithms and lower bounds for online randomized call control in cellular networks, Improved Randomized Online Scheduling of Unit Length Intervals and Jobs, Scheduling to Maximize Participation, Unnamed Item
