scientific article; zbMATH DE number 1256771
From MaRDI portal
Publication:4228507
zbMath0922.68019MaRDI QIDQ4228507
Leighton, Tom, Baruch Awerbuch, Amos Fiat, Yossi Azar
Publication date: 4 October 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (15)
Static strategies for worksharing with unrecoverable interruptions ⋮ Randomized Online Algorithms for Set Cover Leasing Problems ⋮ Sharing video on demand ⋮ Scheduling multicasts on unit-capacity trees and meshes. ⋮ Unnamed Item ⋮ Reliability of task graph schedules with transient and fail-stop failures: complexity and algorithms ⋮ Online maximum \(k\)-coverage ⋮ Static worksharing strategies for heterogeneous computers with unrecoverable interruptions ⋮ Competitive strategy for on-line leasing of depreciable equipment ⋮ Optimizing the reliability of streaming applications under throughput constraints ⋮ Online budgeted maximum coverage ⋮ Approximating the online set multicover problems via randomized winnowing ⋮ Atomic congestion games: fast, myopic and concurrent ⋮ Competitive analysis of the online inventory problem ⋮ Delayed information and action in on-line algorithms
This page was built for publication:
