Vytisknout
0387100 - MÚ 2013 RIV DE eng C - Konferenční příspěvek (zahraniční konf.)
Sgall, Jiří
Open problems in throughput scheduling.
Algorithms – ESA 2012 : 20th Annual European Symposium, Ljubljana, Slovenia, September 10-12, 2012. Proceedings. Berlin: Springer, 2012 - (Epstein, L.; Ferragina, P.), s. 2-11. Lecture Notes in Computer Science, 7501. ISBN 978-3-642-33089-6.
[20th Annual European Symposium on Algorithms (ESA 2012). Ljubljana (SI), 10.09.2012-12.09.2012]
Grant CEP: GA AV ČR IAA100190902
Klíčová slova: problem complexity * scheduling
Kód oboru RIV: BA - Obecná matematika
http://link.springer.com/chapter/10.1007%2F978-3-642-33090-2_2
Trvalý link: http://hdl.handle.net/11104/0219398
Sgall, Jiří
Open problems in throughput scheduling.
Algorithms – ESA 2012 : 20th Annual European Symposium, Ljubljana, Slovenia, September 10-12, 2012. Proceedings. Berlin: Springer, 2012 - (Epstein, L.; Ferragina, P.), s. 2-11. Lecture Notes in Computer Science, 7501. ISBN 978-3-642-33089-6.
[20th Annual European Symposium on Algorithms (ESA 2012). Ljubljana (SI), 10.09.2012-12.09.2012]
Grant CEP: GA AV ČR IAA100190902
Klíčová slova: problem complexity * scheduling
Kód oboru RIV: BA - Obecná matematika
http://link.springer.com/chapter/10.1007%2F978-3-642-33090-2_2
Trvalý link: http://hdl.handle.net/11104/0219398