Author:
Bosman Thomas,van Ee Martijn,Ergen Ekin,Imreh Csanád,Marchetti-Spaccamela Alberto,Skutella Martin,Stougie Leen
Publisher
Springer Nature Switzerland
Reference28 articles.
1. Adamczyk, M., Grandoni, F., Leonardi, S., Wlodarczyk, M.: When the optimum is also blind: a new perspective on universal optimization. In: 44th International Colloquium on Automata, Languages and Programming, ICALP, volume 80 of LIPIcs, pp. 35:1–35:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
2. Lecture Notes in Computer Science;S Albers,2021
3. Mohamed Ali Aloulou and Federico Della Croce: Complexity of single machine scheduling problems under scenario-based uncertainty. Oper. Res. Lett. 36(3), 338–342 (2008)
4. Armon, A., Zwick, U.: Multicriteria global minimum cuts. Algorithmica 46(1), 15–26 (2006)
5. Austrin, P., Hastad, J., Guruswami, V.: ($$2+\epsilon $$)-SAT is NP-hard. In: Proceedings of 55th Annual Symposium on Foundations of Computer Science, pp. 1–10. IEEE (2014)