Algorithmic Performance Guarantees: Foundations and Applications

Project Information

APEG

Grant agreement ID: 691672

DOI 10.3030/691672

Project closed

EC signature date 28 April 2016

Start date 1 October 2016

End date 30 September 2021

Funded under

• EXCELLENT SCIENCE - European Research Council (ERC)

Total cost € 2 404 250,00

EU contribution € 2 404 250,00

Coordinated by

TECHNISCHE UNIVERSITAET MUENCHEN
Germany

CORDIS provides links to public deliverables and publications of HORIZON projects.

Links to deliverables and publications from FP7 projects, as well as links to some specific result types such as dataset and software, are dynamically retrieved from OpenAIRE .

Publications

Peer reviewed articles (14)

Tight Bounds for Online Coloring of Basic Graph Classes

Author(s): Susanne Albers and Sebastian Schraink
Published in: Algorithmica, Issue 83, 2021, Page(s) 337-360, ISSN 0178-4617
Publisher: Springer Verlag
DOI: 10.1007/s00453-020-00759-7

On Energy Conservation in Data Centers

Author(s): Susanne Albers
Published in: ACM Transactions on Parallel Computing, Issue 6/3, 2019, Page(s) 1-26, ISSN 2329-4949
Publisher: ACM
DOI: 10.1145/3364210

Scheduling in the Random-Order Model

Author(s): Susanne Albers, Maximilian Janke
Published in: Algorithmica, Issue 83/9, 2021, Page(s) 2803-2832, ISSN 0178-4617
Publisher: Springer Verlag
DOI: 10.1007/s00453-021-00841-8

Best Fit Bin Packing with Random Order Revisited

Author(s): Susanne Albers, Arindam Khan, Leon Ladewig
Published in: Algorithmica, Issue 83/9, 2021, Page(s) 2833-2858, ISSN 0178-4617
Publisher: Springer Verlag
DOI: 10.1007/s00453-021-00844-5

On the Value of Penalties in Time-Inconsistent Planning

Author(s): Susanne Albers, Dennis Kraft
Published in: ACM Transactions on Economics and Computation, Issue 9/3, 2021, Page(s) 1-18, ISSN 2167-8375
Publisher: ACM
DOI: 10.1145/3456768

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

Author(s): Susanne Albers, Arindam Khan, Leon Ladewig
Published in: Algorithmica, Issue 83/6, 2021, Page(s) 1750-1785, ISSN 0178-4617
Publisher: Springer Verlag
DOI: 10.1007/s00453-021-00801-2

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
Publisher: Academic Press
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
Publisher: Academic Press
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
Publisher: Springer Verlag
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
Publisher: Springer Verlag
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
Publisher: Springer Verlag
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
Publisher: Springer Verlag
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
Publisher: Springer Verlag
DOI: 10.1007/s00224-018-9883-0

New results for the k-secretary problem

Author(s): Susanne Albers, Leon Ladewig
Published in: Theoretical Computer Science, Issue 863, 2021, Page(s) 102-119, ISSN 0304-3975
Publisher: Elsevier BV
DOI: 10.1016/j.tcs.2021.02.022

Conference proceedings (27)

A 4-Approximation Algorithm for Maximum Independent Set of Rectangles

Author(s): Waldo Gálvez, Arindam Khan, Mathieu Mari, Tobias Mömke, Madhusudhan Reddy, Andreas Wiese
Published in: ACM-SIAM Symposium on Discrete Algorithms, 2022
Publisher: ACM SIAM

Algorithms for Right-Sizing Heterogeneous Data Centers

Author(s): Susanne Albers, Jens Quedenfeld
Published in: Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures, 2021, Page(s) 48-58, ISBN 9781450380706
Publisher: ACM
DOI: 10.1145/3409964.3461789

Machine Covering in the Random-Order Model

Author(s): Susanne Albers, Waldo Gálvez, Maximilian Janke
Published in: Proceedings of the 32nd International Symposium on Algorithms and Computation, ISAAC 2021, 2021
Publisher: "Schloss Dagstuhl - Leibniz-Zentrum f{\""{u}}r Informatik"

Online market intermediation

Author(s): Yiannis Giannakopoulos, Elias Koutsoupias, Philip Lazos
Published in: Proceedings 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017), Issue 80, 2017, Page(s) 47:1--47:14
Publisher: Leibniz International Proceedings in Informatics (LIPIcs)
DOI: 10.4230/lipics.icalp.2017.47

New Results for the k-Secretary Problem

Author(s): Susanne Albers and Leon Ladewig
Published in: 30th International Symposium on Algorithms and Computation (ISAAC 2019), Issue 149, 2019, Page(s) 18:1-18:19, ISSN 1868-8969
Publisher: Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.isaac.2019.18

New Bounds for Randomized List Update in the Paid Exchange Model

Author(s): Susanne Albers and Maximilian Janke
Published in: 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020), Issue 154, 2020, Page(s) 12:1--12:17, ISBN 978-3-95977-140-5
Publisher: Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.stacs.2020.12

Explorable Uncertainty in Scheduling with Non-uniform Testing Times

Author(s): Susanne Albers and Alexander Eckl
Published in: Proceedings of the 18th International Workshop on Approximation and Online Algorithms, WAOA 2020, Issue 12806, 2020, Page(s) 127--142
Publisher: Springer Lecture Notes in Computer Science
DOI: 10.1007/978-3-030-80879-2\_9

Algorithms for Energy Conservation in Heterogeneous Data Centers

Author(s): Susanne Albers, Jens Quedenfeld
Published in: Proceedings of the 12th International Conference on Algorithms and Compelxity, CIAC 2021, Issue 12701, 2021, Page(s) 75-89
Publisher: Springer, Lecture Notes in Computer Science
DOI: 10.1007/978-3-030-75242-2\_5

Scheduling in the Secretary Model

Author(s): Susanne Albers, Maximilian Janke
Published in: Proceedings of the 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FST&TCS 2021, 2021
Publisher: "Schloss Dagstuhl - Leibniz-Zentrum f{\""{u}}r Informatik"

Scheduling with Testing on Multiple Identical Parallel Machines

Author(s): Susanne Albers, Alexander Eckl
Published in: Proceedings of the 17th International Symposium on Algorithms and Data Structures, WADS 2021, Issue 12808, 2021, Page(s) 29-42, ISBN 978-3-030-83507-1
Publisher: Springer, Lecture Notes in Compuer Science
DOI: 10.1007/978-3-030-83508-8\_3

Optimal Algorithms for Online b-Matching with Variable Vertex Capacities

Author(s): Susanne Albers, Sebastian Schubert
Published in: Proceedings of the 24th International Conference on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2021,, Issue 207, 2021, Page(s) 2:1-2:18
Publisher: "Schloss Dagstuhl - Leibniz-Zentrum f{\""{u}}r Informatik"
DOI: 10.4230/lipics.approx/random.2021.2

A Tight (3/2+ε) Approximation for Skewed Strip Packing

Author(s): Waldo Galvez and Fabrizio Grandoni and Afrouz Jabal Ameli and Klaus Jansen and Arindam Khan and Malin Rau
Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020), Issue 176, 2020, Page(s) 44:1-44:18, ISBN 978-3-95977-164-1
Publisher: "Schloss Dagstuhl--Leibniz-Zentrum f{\""u}r Informatik"
DOI: 10.4230/lipics.approx/random.2020.44

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
Publisher: Springer Berlin Heidelberg
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
Publisher: Springer Berlin Heidelberg
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, ISBN 9781-450345934
Publisher: ACM Press
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
Publisher: Springer International Publishing
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
Publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
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
Publisher: Leibniz International Proceedings in Informatics (LIPIcs)
DOI: 10.4230/LIPIcs.ESA.2017.7

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, ISBN 978-1-5386-3464-6
Publisher: IEEE
DOI: 10.1109/FOCS.2017.32

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, ISBN 9781-450357999
Publisher: ACM Press
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, ISBN 9781-450367929
Publisher: ACM Press
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, ISBN 978-3-95977-125-2
Publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.approx-random.2019.22

Improved Approximation Algorithms for 2-Dimensional Knapsack: Packing into Multiple L-Shapes, Spirals, and More

Author(s): Waldo Gálvez, Fabrizio Grandoni, Arindam Khan, Diego Ramírez-Romero, Andreas Wiese
Published in: Proceeding of the 37th International Symposium on Computational Geometry, SoCG 2021, Issue 189, 2021, Page(s) 39:1-39:17
Publisher: "LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum f{\""{u}}r Informatik"
DOI: 10.4230/lipics.socg.2021.39

Approximation Algorithms for Demand Strip Packing

Author(s): Waldo Gálvez, Fabrizio Grandoni, Afrouz Jabal Ameli, Kamyar Khodamoradi
Published in: Proceedings of the 24th International Conference on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2021,, Issue 207, 2021, Page(s) 20:1-20:24
Publisher: "LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum f{\""{u}}r Informatik"
DOI: 10.4230/lipics.approx/random.2021.20

Online Makespan Minimization with Budgeted Uncertainty

Author(s): Susanne Albers and Maximilian Janke
Published in: Proceedings of the 17th International Symposium on Algorithms and Data Structures, WADS 2021, Issue 12808, 2021, Page(s) 43-56, ISBN 978-3-030-83507-1
Publisher: Springer, Lecture Notes in Compuer Science
DOI: 10.1007/978-3-030-83508-8\_4

Scheduling in the Random-Order Model

Author(s): Susanne Albers and Maximilian Janke
Published in: 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020), Issue 168, 2020, Page(s) 68:1-68:18, ISBN 978-3-95977-138-2
Publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.icalp.2020.68

Best Fit Bin Packing with Random Order Revisited

Author(s): Susanne Albers and Arindam Khan and Leon Ladewig
Published in: 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020), Issue 170, 2020, Page(s) 7:1-7:15, ISBN 978-3-95977-159-7
Publisher: "Schloss Dagstuhl--Leibniz-Zentrum f{\""u}r Informatik"
DOI: 10.4230/lipics.mfcs.2020.7