×

Found 6 Documents (Results 1–6)

Greedy is optimal for online restricted assignment and smart grid scheduling for unit size jobs. (English) Zbl 1528.68413

Bampis, Evripidis (ed.) et al., Approximation and online algorithms. 17th international workshop, WAOA 2019, Munich, Germany, September 12–13, 2019. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 11926, 217-231 (2020).
MSC:  68W27 90B35
PDFBibTeX XMLCite
Full Text: DOI

Complexity and online algorithms for minimum skyline coloring of intervals. (English) Zbl 1425.68462

Gao, Xiaofeng (ed.) et al., Combinatorial optimization and applications. 11th international conference, COCOA 2017, Shanghai, China, December 16–18, 2017. Proceedings. Part II. Cham: Springer. Lect. Notes Comput. Sci. 10628, 317-332 (2017).
PDFBibTeX XMLCite
Full Text: DOI Link

Optimal nonpreemptive scheduling in a smart grid model. (English) Zbl 1398.90051

Seok-Hee Hong (ed.), 27th international symposium on algorithms and computation, ISAAC 2016, Sydney, Australia, December 12–14, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-026-2). LIPIcs – Leibniz International Proceedings in Informatics 64, Article 53, 13 p. (2016).
MSC:  90B35 68W27
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

Year of Publication

Main Field