Approximation and Online Algorithms
From MaRDI portal
Publication:5896927
DOI10.1007/b95598zbMath1173.68405OpenAlexW4300520713MaRDI QIDQ5896927
Erlebach, Thomas, Vanessa Kääb, Rolf H. Möhring
Publication date: 11 August 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b95598
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)
Related Items (4)
A General Framework for Approximating Min Sum Ordering Problems ⋮ Coping with Incomplete Information in Scheduling — Stochastic and Online Models ⋮ Makespan minimization with OR-precedence constraints ⋮ Precedence-Constrained Min Sum Set Cover
This page was built for publication: Approximation and Online Algorithms
