eBook
Complexity and Inapproximability Results for Parallel Task Scheduling and Strip Packing
| Title: | Complexity and Inapproximability Results for Parallel Task Scheduling and Strip Packing |
|---|---|
| Authors: | Henning, SörenAff15, Jansen, KlausAff15, Rau, MalinAff15, Schmarje, LarsAff15 |
| Contributors: | Hutchison, David, Series EditorAff1, Kanade, Takeo, Series EditorAff2, Kittler, Josef, Series EditorAff3, Kleinberg, Jon M., Series EditorAff4, Mattern, Friedemann, Series EditorAff5, Mitchell, John C., Series EditorAff6, Naor, Moni, Series EditorAff7, Pandu Rangan, C., Series EditorAff8, Steffen, Bernhard, Series EditorAff9, Terzopoulos, Demetri, Series EditorAff10, Tygar, Doug, Series EditorAff11, Weikum, Gerhard, Series EditorAff12, Fomin, Fedor V., editorAff13, Podolskii, Vladimir V., editorAff14 |
| Source: | Computer Science – Theory and Applications : 13th International Computer Science Symposium in Russia, CSR 2018, Moscow, Russia, June 6–10, 2018, Proceedings. 10846:169-180 |
| Database: | Springer Nature eBooks |
| ISBN: | 9783319905297 9783319905303 |
|---|---|
| DOI: | 10.1007/978-3-319-90530-3_15 |