𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On Online Algorithms with Advice for thek-Server Problem

✍ Scribed by Renault, Marc P.; Rosén, Adi

Book ID
120758475
Publisher
Springer
Year
2012
Tongue
English
Weight
664 KB
Volume
56
Category
Article
ISSN
1433-0490

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Greedy On-Line Algorithm for thek-Trac
A Greedy On-Line Algorithm for thek-Track Assignment Problem
✍ U Faigle; W Kern; W.M Nawijn 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 107 KB

Given a collection I I of n jobs that are represented by intervals, we seek a maximal feasible assignment of the jobs to k machines such that not more than Ž . c M intervals overlap pairwise on any machine M and that a job is only assigned to a machine if it fits into one of several prescribed time