Complexity and Inapproximability Results for Parallel Task Scheduling and Strip Packing

Λεπτομέρειες βιβλιογραφικής εγγραφής
Τίτλος:	Complexity and Inapproximability Results for Parallel Task Scheduling and Strip Packing
Συγγραφείς:	Henning, Sören^Aff15, Jansen, Klaus^Aff15, Rau, Malin^Aff15, Schmarje, Lars^Aff15
Συνεισφορές:	Hutchison, David, Series Editor^Aff1, Kanade, Takeo, Series Editor^Aff2, Kittler, Josef, Series Editor^Aff3, Kleinberg, Jon M., Series Editor^Aff4, Mattern, Friedemann, Series Editor^Aff5, Mitchell, John C., Series Editor^Aff6, Naor, Moni, Series Editor^Aff7, Pandu Rangan, C., Series Editor^Aff8, Steffen, Bernhard, Series Editor^Aff9, Terzopoulos, Demetri, Series Editor^Aff10, Tygar, Doug, Series Editor^Aff11, Weikum, Gerhard, Series Editor^Aff12, Fomin, Fedor V., editor^Aff13, Podolskii, Vladimir V., editor^Aff14
Πηγή:	Computer Science – Theory and Applications : 13th International Computer Science Symposium in Russia, CSR 2018, Moscow, Russia, June 6–10, 2018, Proceedings. 10846:169-180
Βάση Δεδομένων:	Springer Nature eBooks

καταχωρήστε σχόλιο πρώτοι!