Filter
Conference contribution

Search results

  • 2020

    Precedence-Constrained Scheduling and Min-Sum Set Cover: (Extended Abstract)

    Happach, F. & Schulz, A. S., 2020, Approximation and Online Algorithms - 17th International Workshop, WAOA 2019, Revised Selected Papers. Bampis, E. & Megow, N. (eds.). Springer, p. 170-187 18 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11926 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    2 Scopus citations
  • 2019

    Robust appointment scheduling with heterogeneous costs

    Schulz, A. S. & Udwani, R., Sep 2019, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019. Achlioptas, D. & Vegh, L. A. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 25. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 145).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • 2016

    Min-sum scheduling under precedence constraints

    Schulz, A. S. & Verschae, J., 1 Aug 2016, 24th Annual European Symposium on Algorithms, ESA 2016. Zaroliagis, C. & Sankowski, P. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 74. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 57).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    3 Scopus citations