scientific article; zbMATH DE number 1947422
From MaRDI portal
Publication:4411391
zbMath1019.68818MaRDI QIDQ4411391
Publication date: 8 July 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2461/24610562.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)
Related Items (2)
Approximate strong separation with application in fractional graph coloring and preemptive scheduling. ⋮ A \(\frac 54\)-approximation algorithm for scheduling identical malleable tasks
This page was built for publication: