Algorithmic Performance Guarantees: Foundations and Applications

Informazioni relative al progetto

APEG

ID dell’accordo di sovvenzione: 691672

DOI 10.3030/691672

Progetto chiuso

Data della firma CE 28 Aprile 2016

Data di avvio 1 Ottobre 2016

Data di completamento 30 Settembre 2021

Finanziato da

• EXCELLENT SCIENCE - European Research Council (ERC)

Costo totale € 2 404 250,00

Contributo UE € 2 404 250,00

Coordinato da

TECHNISCHE UNIVERSITAET MUENCHEN
Germany

Pubblicazioni

Peer reviewed articles (14)

Tight Bounds for Online Coloring of Basic Graph Classes

Autori: Susanne Albers and Sebastian Schraink
Pubblicato in: Algorithmica, Numero 83, 2021, Pagina/e 337-360, ISSN 0178-4617
Editore: Springer Verlag
DOI: 10.1007/s00453-020-00759-7

On Energy Conservation in Data Centers

Autori: Susanne Albers
Pubblicato in: ACM Transactions on Parallel Computing, Numero 6/3, 2019, Pagina/e 1-26, ISSN 2329-4949
Editore: ACM
DOI: 10.1145/3364210

Scheduling in the Random-Order Model

Autori: Susanne Albers, Maximilian Janke
Pubblicato in: Algorithmica, Numero 83/9, 2021, Pagina/e 2803-2832, ISSN 0178-4617
Editore: Springer Verlag
DOI: 10.1007/s00453-021-00841-8

Best Fit Bin Packing with Random Order Revisited

Autori: Susanne Albers, Arindam Khan, Leon Ladewig
Pubblicato in: Algorithmica, Numero 83/9, 2021, Pagina/e 2833-2858, ISSN 0178-4617
Editore: Springer Verlag
DOI: 10.1007/s00453-021-00844-5

On the Value of Penalties in Time-Inconsistent Planning

Autori: Susanne Albers, Dennis Kraft
Pubblicato in: ACM Transactions on Economics and Computation, Numero 9/3, 2021, Pagina/e 1-18, ISSN 2167-8375
Editore: ACM
DOI: 10.1145/3456768

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

Autori: Susanne Albers, Arindam Khan, Leon Ladewig
Pubblicato in: Algorithmica, Numero 83/6, 2021, Pagina/e 1750-1785, ISSN 0178-4617
Editore: Springer Verlag
DOI: 10.1007/s00453-021-00801-2

On list update with locality of reference

Autori: Susanne Albers, Sonja Lauer
Pubblicato in: Journal of Computer and System Sciences, Numero 82/5, 2016, Pagina/e 627-653, ISSN 0022-0000
Editore: Academic Press
DOI: 10.1016/j.jcss.2015.11.005

Scheduling on power-heterogeneous processors

Autori: Susanne Albers, Evripidis Bampis, Dimitrios Letsios, Giorgio Lucarelli, Richard Stotz
Pubblicato in: Information and Computation, Numero 257, 2017, Pagina/e 22-33, ISSN 0890-5401
Editore: Academic Press
DOI: 10.1016/j.ic.2017.09.013

On the Value of Job Migration in Online Makespan Minimization

Autori: Susanne Albers, Matthias Hellwig
Pubblicato in: Algorithmica, Numero 79/2, 2017, Pagina/e 598-623, ISSN 0178-4617
Editore: Springer Verlag
DOI: 10.1007/s00453-016-0209-9

Online Makespan Minimization with Parallel Schedules

Autori: Susanne Albers, Matthias Hellwig
Pubblicato in: Algorithmica, Numero 78/2, 2017, Pagina/e 492-520, ISSN 0178-4617
Editore: Springer Verlag
DOI: 10.1007/s00453-016-0172-5

Quantifying Competitiveness in Paging with Locality of Reference

Autori: Susanne Albers, Dario Frascaria
Pubblicato in: Algorithmica, Numero 80/12, 2018, Pagina/e 3563-3596, ISSN 0178-4617
Editore: Springer Verlag
DOI: 10.1007/s00453-018-0406-9

New Online Algorithms for Story Scheduling in Web Advertising

Autori: Susanne Albers, Achim Passen
Pubblicato in: Algorithmica, Numero 81/1, 2019, Pagina/e 1-25, ISSN 0178-4617
Editore: Springer Verlag
DOI: 10.1007/s00453-018-0428-3

Motivating Time-Inconsistent Agents: A Computational Approach

Autori: Susanne Albers, Dennis Kraft
Pubblicato in: Theory of Computing Systems, Numero 63/3, 2019, Pagina/e 466-487, ISSN 1432-4350
Editore: Springer Verlag
DOI: 10.1007/s00224-018-9883-0

New results for the k-secretary problem

Autori: Susanne Albers, Leon Ladewig
Pubblicato in: Theoretical Computer Science, Numero 863, 2021, Pagina/e 102-119, ISSN 0304-3975
Editore: Elsevier BV
DOI: 10.1016/j.tcs.2021.02.022

Conference proceedings (27)

A 4-Approximation Algorithm for Maximum Independent Set of Rectangles

Autori: Waldo Gálvez, Arindam Khan, Mathieu Mari, Tobias Mömke, Madhusudhan Reddy, Andreas Wiese
Pubblicato in: ACM-SIAM Symposium on Discrete Algorithms, 2022
Editore: ACM SIAM

Algorithms for Right-Sizing Heterogeneous Data Centers

Autori: Susanne Albers, Jens Quedenfeld
Pubblicato in: Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures, 2021, Pagina/e 48-58, ISBN 9781450380706
Editore: ACM
DOI: 10.1145/3409964.3461789

Machine Covering in the Random-Order Model

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

Online market intermediation

Autori: Yiannis Giannakopoulos, Elias Koutsoupias, Philip Lazos
Pubblicato in: Proceedings 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017), Numero 80, 2017, Pagina/e 47:1--47:14
Editore: Leibniz International Proceedings in Informatics (LIPIcs)
DOI: 10.4230/lipics.icalp.2017.47

New Results for the k-Secretary Problem

Autori: Susanne Albers and Leon Ladewig
Pubblicato in: 30th International Symposium on Algorithms and Computation (ISAAC 2019), Numero 149, 2019, Pagina/e 18:1-18:19, ISSN 1868-8969
Editore: Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.isaac.2019.18

New Bounds for Randomized List Update in the Paid Exchange Model

Autori: Susanne Albers and Maximilian Janke
Pubblicato in: 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020), Numero 154, 2020, Pagina/e 12:1--12:17, ISBN 978-3-95977-140-5
Editore: Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.stacs.2020.12

Explorable Uncertainty in Scheduling with Non-uniform Testing Times

Autori: Susanne Albers and Alexander Eckl
Pubblicato in: Proceedings of the 18th International Workshop on Approximation and Online Algorithms, WAOA 2020, Numero 12806, 2020, Pagina/e 127--142
Editore: Springer Lecture Notes in Computer Science
DOI: 10.1007/978-3-030-80879-2\_9

Algorithms for Energy Conservation in Heterogeneous Data Centers

Autori: Susanne Albers, Jens Quedenfeld
Pubblicato in: Proceedings of the 12th International Conference on Algorithms and Compelxity, CIAC 2021, Numero 12701, 2021, Pagina/e 75-89
Editore: Springer, Lecture Notes in Computer Science
DOI: 10.1007/978-3-030-75242-2\_5

Scheduling in the Secretary Model

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

Scheduling with Testing on Multiple Identical Parallel Machines

Autori: Susanne Albers, Alexander Eckl
Pubblicato in: Proceedings of the 17th International Symposium on Algorithms and Data Structures, WADS 2021, Numero 12808, 2021, Pagina/e 29-42, ISBN 978-3-030-83507-1
Editore: 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

Autori: Susanne Albers, Sebastian Schubert
Pubblicato in: Proceedings of the 24th International Conference on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2021,, Numero 207, 2021, Pagina/e 2:1-2:18
Editore: "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

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

Scheduling on Power-Heterogeneous Processors.

Autori: Susanne Albers, Evripidis Bampis, Dimitrios Letsios, Giorgio Lucarelli, Richard Stotz
Pubblicato in: 12th Latin American Symposium on Theoretical Informatics (LATIN 2016), Numero Springer LNCS9644, 2016, Pagina/e 41-54
Editore: Springer Berlin Heidelberg
DOI: 10.1007/978-3-662-49529-2_4

Motivating Time-Inconsistent Agents: A Computational Approach

Autori: Susanne Albers, Dennis Kraft
Pubblicato in: 12th International Conference on Web and Internet Economics (WINE 2016), Numero Springer LNCS 10123, 2016, Pagina/e 309-323
Editore: Springer Berlin Heidelberg
DOI: 10.1007/978-3-662-54110-4_22

On Energy Conservation in Data Centers

Autori: Susanne Albers
Pubblicato in: Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures - SPAA '17, 2017, Pagina/e 35-44, ISBN 9781-450345934
Editore: ACM Press
DOI: 10.1145/3087556.3087560

The Price of Uncertainty in Present-Biased Planning

Autori: Susanne Albers, Dennis Kraft
Pubblicato in: 13th International Conference on Web and Internet Economics (WINE 2017), Numero Springer LNCS 10660, 2017, Pagina/e 325-339
Editore: Springer International Publishing
DOI: 10.1007/978-3-319-71924-5_23

On the Value of Penalties in Time-Inconsistent Planning

Autori: Susanne Albers, Dennis Kraft
Pubblicato in: 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017), Numero Volume 80, 2017, Pagina/e 10:1--10:12
Editore: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/LIPIcs.ICALP.2017.10

Tight Bounds for Online Coloring of Basic Graph Classes

Autori: Albers, Susanne; Schraink, Sebastian
Pubblicato in: 25th Annual European Symposium on Algorithms (ESA 2017), Numero 87, 2017, Pagina/e 7:1 --7:14
Editore: Leibniz International Proceedings in Informatics (LIPIcs)
DOI: 10.4230/LIPIcs.ESA.2017.7

Approximating Geometric Knapsack via L-Packings

Autori: Waldo Galvez, Fabrizio Grandoni, Sandy Heydrich, Salvatore Ingala, Arindam Khan, Andreas Wiese
Pubblicato in: 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS), 2017, Pagina/e 260-271, ISBN 978-1-5386-3464-6
Editore: IEEE
DOI: 10.1109/FOCS.2017.32

Optimal Algorithms for Right-Sizing Data Centers

Autori: Susanne Albers, Jens Quedenfeld
Pubblicato in: Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA '18, 2018, Pagina/e 363-372, ISBN 9781-450357999
Editore: ACM Press
DOI: 10.1145/3210377.3210385

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

Autori: José Correa, Paul Dütting, Felix Fischer, Kevin Schewior
Pubblicato in: Proceedings of the 2019 ACM Conference on Economics and Computation - EC '19, 2019, Pagina/e 3-17, ISBN 9781-450367929
Editore: ACM Press
DOI: 10.1145/3328526.3329627

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

Autori: Susanne Albers and Arindam Khan and Leon Ladewig
Pubblicato in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019), Numero 145, 2019, Pagina/e 22:1--22:23, ISBN 978-3-95977-125-2
Editore: 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

Autori: Waldo Gálvez, Fabrizio Grandoni, Arindam Khan, Diego Ramírez-Romero, Andreas Wiese
Pubblicato in: Proceeding of the 37th International Symposium on Computational Geometry, SoCG 2021, Numero 189, 2021, Pagina/e 39:1-39:17
Editore: "LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum f{\""{u}}r Informatik"
DOI: 10.4230/lipics.socg.2021.39

Approximation Algorithms for Demand Strip Packing

Autori: Waldo Gálvez, Fabrizio Grandoni, Afrouz Jabal Ameli, Kamyar Khodamoradi
Pubblicato in: Proceedings of the 24th International Conference on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2021,, Numero 207, 2021, Pagina/e 20:1-20:24
Editore: "LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum f{\""{u}}r Informatik"
DOI: 10.4230/lipics.approx/random.2021.20

Online Makespan Minimization with Budgeted Uncertainty

Autori: Susanne Albers and Maximilian Janke
Pubblicato in: Proceedings of the 17th International Symposium on Algorithms and Data Structures, WADS 2021, Numero 12808, 2021, Pagina/e 43-56, ISBN 978-3-030-83507-1
Editore: Springer, Lecture Notes in Compuer Science
DOI: 10.1007/978-3-030-83508-8\_4

Scheduling in the Random-Order Model

Autori: Susanne Albers and Maximilian Janke
Pubblicato in: 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020), Numero 168, 2020, Pagina/e 68:1-68:18, ISBN 978-3-95977-138-2
Editore: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.icalp.2020.68

Best Fit Bin Packing with Random Order Revisited

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