Beating the logarithmic lower bound: randomized preemptive disjoint paths and call control algorithms

DOI10.1023/A:1022933824889zbMath1154.90397OpenAlexW2020384210MaRDI QIDQ2464381

Ran Adler, Yossi Azar

Publication date: 20 December 2007

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1022933824889

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (2)

Online selection of intervals and \(t\)-intervals ⋮ Online time-constrained scheduling in linear and ring networks

This page was built for publication: Beating the logarithmic lower bound: randomized preemptive disjoint paths and call control algorithms