scientific article
From MaRDI portal
Publication:3128889
zbMath0873.68012MaRDI QIDQ3128889
Andrew Tomkins, Richard J. Lipton
Publication date: 29 October 1997
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (46)
Scheduling broadcasts with deadlines ⋮ Online Optimization of Busy Time on Parallel Machines ⋮ A randomized algorithm for online unit clustering ⋮ The Temp Secretary Problem ⋮ Online real-time preemptive scheduling of jobs with deadlines on multiple machines ⋮ A Randomized Algorithm for Online Scheduling with Interval Conflicts ⋮ Online scheduling of car-sharing request pairs between two locations ⋮ Fixed interval scheduling: models, applications, computational complexity and algorithms ⋮ Randomized online algorithms for maximizing busy time interval scheduling ⋮ Randomized on-line algorithms and lower bounds for computing large independent sets in disk graphs ⋮ Online scheduling with interval conflicts ⋮ Optimal Allocation for Chunked-Reward Advertising ⋮ Online selection of intervals and \(t\)-intervals ⋮ On-line scheduling with hard deadlines ⋮ Online time-constrained scheduling in linear and ring networks ⋮ Approximation algorithms for stochastic online matching with reusable resources ⋮ Sharing video on demand ⋮ Adaptive Video on Demand ⋮ Online interval scheduling on two related machines: the power of lookahead ⋮ Online car-sharing problem with variable booking times ⋮ An Optimal Strategy for Online Non-uniform Length Order Scheduling ⋮ A Preemptive Algorithm for Maximizing Disjoint Paths on Trees ⋮ Advice complexity of adaptive priority algorithms ⋮ Online interval scheduling with a bounded number of failures ⋮ Interval scheduling: A survey ⋮ Unnamed Item ⋮ Breaking 1 - 1/e Barrier for Nonpreemptive Throughput Maximization ⋮ Online two-way trading: randomization and advice ⋮ Dynamic algorithms for monotonic interval scheduling problem ⋮ Online optimization of busy time on parallel machines ⋮ A near optimal scheduler for on-demand data broadcasts ⋮ Optimally Handling Commitment Issues in Online Throughput Maximization ⋮ Online C-benevolent job scheduling on multiple machines ⋮ A preemptive algorithm for maximizing disjoint paths on trees ⋮ Packing random intervals ⋮ Online interval scheduling to maximize total satisfaction ⋮ A general framework for handling commitment in online throughput maximization ⋮ Note on scheduling intervals on-line ⋮ On Job Scheduling with Preemption Penalties ⋮ Randomized online interval scheduling ⋮ Online interval scheduling: Randomized and multiprocessor cases ⋮ Online deadline scheduling on faster machines. ⋮ Online independent sets. ⋮ Advice complexity of maximum independent set in sparse and bipartite graphs ⋮ Competitive on-line scheduling of continuous-media streams ⋮ Efficient job scheduling algorithms with multi-type contentions
This page was built for publication:
