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