Skip to main content

Algorithmic Performance Guarantees: Foundations and Applications

Searching for OpenAIRE data...

Publications

Scheduling on Power-Heterogeneous Processors.

Author(s): Susanne Albers, Evripidis Bampis, Dimitrios Letsios, Giorgio Lucarelli, Richard Stotz
Published in: 12th Latin American Symposium on Theoretical Informatics (LATIN 2016), Issue Springer LNCS9644, 2016, Page(s) 41-54
DOI: 10.1007/978-3-662-49529-2_4

Motivating Time-Inconsistent Agents: A Computational Approach

Author(s): Susanne Albers, Dennis Kraft
Published in: 12th International Conference on Web and Internet Economics (WINE 2016), Issue Springer LNCS 10123, 2016, Page(s) 309-323
DOI: 10.1007/978-3-662-54110-4_22

On Energy Conservation in Data Centers

Author(s): Susanne Albers
Published in: Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures - SPAA '17, 2017, Page(s) 35-44
DOI: 10.1145/3087556.3087560

The Price of Uncertainty in Present-Biased Planning

Author(s): Susanne Albers, Dennis Kraft
Published in: 13th International Conference on Web and Internet Economics (WINE 2017), Issue Springer LNCS 10660, 2017, Page(s) 325-339
DOI: 10.1007/978-3-319-71924-5_23

On the Value of Penalties in Time-Inconsistent Planning

Author(s): Susanne Albers, Dennis Kraft
Published in: 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017), Issue Volume 80, 2017, Page(s) 10:1--10:12
DOI: 10.4230/LIPIcs.ICALP.2017.10

Tight Bounds for Online Coloring of Basic Graph Classes

Author(s): Albers, Susanne; Schraink, Sebastian
Published in: 25th Annual European Symposium on Algorithms (ESA 2017), Issue 87, 2017, Page(s) 7:1 --7:14
DOI: 10.4230/LIPIcs.ESA.2017.7

Improved Pseudo-Polynomial-Time Approximation for Strip Packing

Author(s): Gálvez, Waldo; Grandoni, Fabrizio; Ingala, Salvatore; Khan, Arindam
Published in: 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2016), Issue 65, 2016, Page(s) 9:1 -- 9:14
DOI: 10.4230/LIPIcs.FSTTCS.2016.9

Approximating Geometric Knapsack via L-Packings

Author(s): Waldo Galvez, Fabrizio Grandoni, Sandy Heydrich, Salvatore Ingala, Arindam Khan, Andreas Wiese
Published in: 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS), 2017, Page(s) 260-271
DOI: 10.1109/FOCS.2017.32

Online Strip Packing with Polynomial Migration

Author(s): Klaus Jansen and Kim-Manuel Klein and Maria Kosche and Leon Ladewig
Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2017), Issue 81, 2017, Page(s) 13:1 -- 13:18
DOI: 10.4230/LIPIcs.APPROX-RANDOM.2017.13

Optimal Algorithms for Right-Sizing Data Centers

Author(s): Susanne Albers, Jens Quedenfeld
Published in: Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA '18, 2018, Page(s) 363-372
DOI: 10.1145/3210377.3210385

Prophet Inequalities for I.I.D. Random Variables from an Unknown Distribution

Author(s): José Correa, Paul Dütting, Felix Fischer, Kevin Schewior
Published in: Proceedings of the 2019 ACM Conference on Economics and Computation - EC '19, 2019, Page(s) 3-17
DOI: 10.1145/3328526.3329627

Improved Online Algorithms for Knapsack and GAP in the Random Order Model

Author(s): Susanne Albers and Arindam Khan and Leon Ladewig
Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019), Issue 145, 2019, Page(s) 22:1--22:23
DOI: 10.4230/lipics.approx-random.2019.22

On list update with locality of reference

Author(s): Susanne Albers, Sonja Lauer
Published in: Journal of Computer and System Sciences, Issue 82/5, 2016, Page(s) 627-653, ISSN 0022-0000
DOI: 10.1016/j.jcss.2015.11.005

Scheduling on power-heterogeneous processors

Author(s): Susanne Albers, Evripidis Bampis, Dimitrios Letsios, Giorgio Lucarelli, Richard Stotz
Published in: Information and Computation, Issue 257, 2017, Page(s) 22-33, ISSN 0890-5401
DOI: 10.1016/j.ic.2017.09.013

On the Value of Job Migration in Online Makespan Minimization

Author(s): Susanne Albers, Matthias Hellwig
Published in: Algorithmica, Issue 79/2, 2017, Page(s) 598-623, ISSN 0178-4617
DOI: 10.1007/s00453-016-0209-9

Online Makespan Minimization with Parallel Schedules

Author(s): Susanne Albers, Matthias Hellwig
Published in: Algorithmica, Issue 78/2, 2017, Page(s) 492-520, ISSN 0178-4617
DOI: 10.1007/s00453-016-0172-5

Quantifying Competitiveness in Paging with Locality of Reference

Author(s): Susanne Albers, Dario Frascaria
Published in: Algorithmica, Issue 80/12, 2018, Page(s) 3563-3596, ISSN 0178-4617
DOI: 10.1007/s00453-018-0406-9

New Online Algorithms for Story Scheduling in Web Advertising

Author(s): Susanne Albers, Achim Passen
Published in: Algorithmica, Issue 81/1, 2019, Page(s) 1-25, ISSN 0178-4617
DOI: 10.1007/s00453-018-0428-3

Motivating Time-Inconsistent Agents: A Computational Approach

Author(s): Susanne Albers, Dennis Kraft
Published in: Theory of Computing Systems, Issue 63/3, 2019, Page(s) 466-487, ISSN 1432-4350
DOI: 10.1007/s00224-018-9883-0