On the value of preemption in scheduling

Bartal, Yair; Leonardi, Stefano; Shallom, Gill; Sitters, Rene; Diaz, Josep; Jansen, Klaus; Rolim, José D. P.; Zwick, Uri

アイテム詳細

登録内容を編集ファイル形式で保存

一時保存へ追加

タグ情報を表示リリース履歴を表示詳細要約

公開

会議論文

On the value of preemption in scheduling

MPS-Authors

/persons/resource/persons44913

Leonardi, Stefano
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45495

Sitters, Rene
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons44695

Jansen, Klaus
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

There are no locators available

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

フルテキスト (公開)

公開されているフルテキストはありません

付随資料 (公開)

There is no public supplementary material available

引用

Bartal, Y., Leonardi, S., Shallom, G., & Sitters, R. (2006). On the value of preemption in scheduling. In 9th Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX (pp. 39-48). Berlin, Germany: Springer.

引用: https://hdl.handle.net/11858/00-001M-0000-000F-23A4-4

要旨

要旨はありません