European Commission logo
español español
CORDIS - Resultados de investigaciones de la UE
CORDIS

Algorithmic Performance Guarantees: Foundations and Applications

Publicaciones

Tight Bounds for Online Coloring of Basic Graph Classes

Autores: Susanne Albers and Sebastian Schraink
Publicado en: Algorithmica, Edición 83, 2021, Página(s) 337-360, ISSN 0178-4617
Editor: Springer Verlag
DOI: 10.1007/s00453-020-00759-7

On Energy Conservation in Data Centers

Autores: Susanne Albers
Publicado en: ACM Transactions on Parallel Computing, Edición 6/3, 2019, Página(s) 1-26, ISSN 2329-4949
Editor: ACM
DOI: 10.1145/3364210

Scheduling in the Random-Order Model

Autores: Susanne Albers, Maximilian Janke
Publicado en: Algorithmica, Edición 83/9, 2021, Página(s) 2803-2832, ISSN 0178-4617
Editor: Springer Verlag
DOI: 10.1007/s00453-021-00841-8

Best Fit Bin Packing with Random Order Revisited

Autores: Susanne Albers, Arindam Khan, Leon Ladewig
Publicado en: Algorithmica, Edición 83/9, 2021, Página(s) 2833-2858, ISSN 0178-4617
Editor: Springer Verlag
DOI: 10.1007/s00453-021-00844-5

On the Value of Penalties in Time-Inconsistent Planning

Autores: Susanne Albers, Dennis Kraft
Publicado en: ACM Transactions on Economics and Computation, Edición 9/3, 2021, Página(s) 1-18, ISSN 2167-8375
Editor: ACM
DOI: 10.1145/3456768

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

Autores: Susanne Albers, Arindam Khan, Leon Ladewig
Publicado en: Algorithmica, Edición 83/6, 2021, Página(s) 1750-1785, ISSN 0178-4617
Editor: Springer Verlag
DOI: 10.1007/s00453-021-00801-2

On list update with locality of reference

Autores: Susanne Albers, Sonja Lauer
Publicado en: Journal of Computer and System Sciences, Edición 82/5, 2016, Página(s) 627-653, ISSN 0022-0000
Editor: Academic Press
DOI: 10.1016/j.jcss.2015.11.005

Scheduling on power-heterogeneous processors

Autores: Susanne Albers, Evripidis Bampis, Dimitrios Letsios, Giorgio Lucarelli, Richard Stotz
Publicado en: Information and Computation, Edición 257, 2017, Página(s) 22-33, ISSN 0890-5401
Editor: Academic Press
DOI: 10.1016/j.ic.2017.09.013

On the Value of Job Migration in Online Makespan Minimization

Autores: Susanne Albers, Matthias Hellwig
Publicado en: Algorithmica, Edición 79/2, 2017, Página(s) 598-623, ISSN 0178-4617
Editor: Springer Verlag
DOI: 10.1007/s00453-016-0209-9

Online Makespan Minimization with Parallel Schedules

Autores: Susanne Albers, Matthias Hellwig
Publicado en: Algorithmica, Edición 78/2, 2017, Página(s) 492-520, ISSN 0178-4617
Editor: Springer Verlag
DOI: 10.1007/s00453-016-0172-5

Quantifying Competitiveness in Paging with Locality of Reference

Autores: Susanne Albers, Dario Frascaria
Publicado en: Algorithmica, Edición 80/12, 2018, Página(s) 3563-3596, ISSN 0178-4617
Editor: Springer Verlag
DOI: 10.1007/s00453-018-0406-9

New Online Algorithms for Story Scheduling in Web Advertising

Autores: Susanne Albers, Achim Passen
Publicado en: Algorithmica, Edición 81/1, 2019, Página(s) 1-25, ISSN 0178-4617
Editor: Springer Verlag
DOI: 10.1007/s00453-018-0428-3

Motivating Time-Inconsistent Agents: A Computational Approach

Autores: Susanne Albers, Dennis Kraft
Publicado en: Theory of Computing Systems, Edición 63/3, 2019, Página(s) 466-487, ISSN 1432-4350
Editor: Springer Verlag
DOI: 10.1007/s00224-018-9883-0

New results for the k-secretary problem

Autores: Susanne Albers, Leon Ladewig
Publicado en: Theoretical Computer Science, Edición 863, 2021, Página(s) 102-119, ISSN 0304-3975
Editor: Elsevier BV
DOI: 10.1016/j.tcs.2021.02.022

A 4-Approximation Algorithm for Maximum Independent Set of Rectangles

Autores: Waldo Gálvez, Arindam Khan, Mathieu Mari, Tobias Mömke, Madhusudhan Reddy, Andreas Wiese
Publicado en: ACM-SIAM Symposium on Discrete Algorithms, 2022
Editor: ACM SIAM

Algorithms for Right-Sizing Heterogeneous Data Centers

Autores: Susanne Albers, Jens Quedenfeld
Publicado en: Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures, 2021, Página(s) 48-58, ISBN 9781450380706
Editor: ACM
DOI: 10.1145/3409964.3461789

Machine Covering in the Random-Order Model

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

Online market intermediation

Autores: Yiannis Giannakopoulos, Elias Koutsoupias, Philip Lazos
Publicado en: Proceedings 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017), Edición 80, 2017, Página(s) 47:1--47:14
Editor: Leibniz International Proceedings in Informatics (LIPIcs)
DOI: 10.4230/lipics.icalp.2017.47

New Results for the k-Secretary Problem

Autores: Susanne Albers and Leon Ladewig
Publicado en: 30th International Symposium on Algorithms and Computation (ISAAC 2019), Edición 149, 2019, Página(s) 18:1-18:19, ISSN 1868-8969
Editor: Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.isaac.2019.18

New Bounds for Randomized List Update in the Paid Exchange Model

Autores: Susanne Albers and Maximilian Janke
Publicado en: 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020), Edición 154, 2020, Página(s) 12:1--12:17, ISBN 978-3-95977-140-5
Editor: Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.stacs.2020.12

Explorable Uncertainty in Scheduling with Non-uniform Testing Times

Autores: Susanne Albers and Alexander Eckl
Publicado en: Proceedings of the 18th International Workshop on Approximation and Online Algorithms, WAOA 2020, Edición 12806, 2020, Página(s) 127--142
Editor: Springer Lecture Notes in Computer Science
DOI: 10.1007/978-3-030-80879-2\_9

Algorithms for Energy Conservation in Heterogeneous Data Centers

Autores: Susanne Albers, Jens Quedenfeld
Publicado en: Proceedings of the 12th International Conference on Algorithms and Compelxity, CIAC 2021, Edición 12701, 2021, Página(s) 75-89
Editor: Springer, Lecture Notes in Computer Science
DOI: 10.1007/978-3-030-75242-2\_5

Scheduling in the Secretary Model

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

Scheduling with Testing on Multiple Identical Parallel Machines

Autores: Susanne Albers, Alexander Eckl
Publicado en: Proceedings of the 17th International Symposium on Algorithms and Data Structures, WADS 2021, Edición 12808, 2021, Página(s) 29-42, ISBN 978-3-030-83507-1
Editor: 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

Autores: Susanne Albers, Sebastian Schubert
Publicado en: Proceedings of the 24th International Conference on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2021,, Edición 207, 2021, Página(s) 2:1-2:18
Editor: "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

Autores: Waldo Galvez and Fabrizio Grandoni and Afrouz Jabal Ameli and Klaus Jansen and Arindam Khan and Malin Rau
Publicado en: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020), Edición 176, 2020, Página(s) 44:1-44:18, ISBN 978-3-95977-164-1
Editor: "Schloss Dagstuhl--Leibniz-Zentrum f{\""u}r Informatik"
DOI: 10.4230/lipics.approx/random.2020.44

Scheduling on Power-Heterogeneous Processors.

Autores: Susanne Albers, Evripidis Bampis, Dimitrios Letsios, Giorgio Lucarelli, Richard Stotz
Publicado en: 12th Latin American Symposium on Theoretical Informatics (LATIN 2016), Edición Springer LNCS9644, 2016, Página(s) 41-54
Editor: Springer Berlin Heidelberg
DOI: 10.1007/978-3-662-49529-2_4

Motivating Time-Inconsistent Agents: A Computational Approach

Autores: Susanne Albers, Dennis Kraft
Publicado en: 12th International Conference on Web and Internet Economics (WINE 2016), Edición Springer LNCS 10123, 2016, Página(s) 309-323
Editor: Springer Berlin Heidelberg
DOI: 10.1007/978-3-662-54110-4_22

On Energy Conservation in Data Centers

Autores: Susanne Albers
Publicado en: Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures - SPAA '17, 2017, Página(s) 35-44, ISBN 9781-450345934
Editor: ACM Press
DOI: 10.1145/3087556.3087560

The Price of Uncertainty in Present-Biased Planning

Autores: Susanne Albers, Dennis Kraft
Publicado en: 13th International Conference on Web and Internet Economics (WINE 2017), Edición Springer LNCS 10660, 2017, Página(s) 325-339
Editor: Springer International Publishing
DOI: 10.1007/978-3-319-71924-5_23

On the Value of Penalties in Time-Inconsistent Planning

Autores: Susanne Albers, Dennis Kraft
Publicado en: 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017), Edición Volume 80, 2017, Página(s) 10:1--10:12
Editor: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/LIPIcs.ICALP.2017.10

Tight Bounds for Online Coloring of Basic Graph Classes

Autores: Albers, Susanne; Schraink, Sebastian
Publicado en: 25th Annual European Symposium on Algorithms (ESA 2017), Edición 87, 2017, Página(s) 7:1 --7:14
Editor: Leibniz International Proceedings in Informatics (LIPIcs)
DOI: 10.4230/LIPIcs.ESA.2017.7

Approximating Geometric Knapsack via L-Packings

Autores: Waldo Galvez, Fabrizio Grandoni, Sandy Heydrich, Salvatore Ingala, Arindam Khan, Andreas Wiese
Publicado en: 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS), 2017, Página(s) 260-271, ISBN 978-1-5386-3464-6
Editor: IEEE
DOI: 10.1109/FOCS.2017.32

Optimal Algorithms for Right-Sizing Data Centers

Autores: Susanne Albers, Jens Quedenfeld
Publicado en: Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA '18, 2018, Página(s) 363-372, ISBN 9781-450357999
Editor: ACM Press
DOI: 10.1145/3210377.3210385

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

Autores: José Correa, Paul Dütting, Felix Fischer, Kevin Schewior
Publicado en: Proceedings of the 2019 ACM Conference on Economics and Computation - EC '19, 2019, Página(s) 3-17, ISBN 9781-450367929
Editor: ACM Press
DOI: 10.1145/3328526.3329627

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

Autores: Susanne Albers and Arindam Khan and Leon Ladewig
Publicado en: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019), Edición 145, 2019, Página(s) 22:1--22:23, ISBN 978-3-95977-125-2
Editor: 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

Autores: Waldo Gálvez, Fabrizio Grandoni, Arindam Khan, Diego Ramírez-Romero, Andreas Wiese
Publicado en: Proceeding of the 37th International Symposium on Computational Geometry, SoCG 2021, Edición 189, 2021, Página(s) 39:1-39:17
Editor: "LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum f{\""{u}}r Informatik"
DOI: 10.4230/lipics.socg.2021.39

Approximation Algorithms for Demand Strip Packing

Autores: Waldo Gálvez, Fabrizio Grandoni, Afrouz Jabal Ameli, Kamyar Khodamoradi
Publicado en: Proceedings of the 24th International Conference on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2021,, Edición 207, 2021, Página(s) 20:1-20:24
Editor: "LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum f{\""{u}}r Informatik"
DOI: 10.4230/lipics.approx/random.2021.20

Online Makespan Minimization with Budgeted Uncertainty

Autores: Susanne Albers and Maximilian Janke
Publicado en: Proceedings of the 17th International Symposium on Algorithms and Data Structures, WADS 2021, Edición 12808, 2021, Página(s) 43-56, ISBN 978-3-030-83507-1
Editor: Springer, Lecture Notes in Compuer Science
DOI: 10.1007/978-3-030-83508-8\_4

Scheduling in the Random-Order Model

Autores: Susanne Albers and Maximilian Janke
Publicado en: 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020), Edición 168, 2020, Página(s) 68:1-68:18, ISBN 978-3-95977-138-2
Editor: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.icalp.2020.68

Best Fit Bin Packing with Random Order Revisited

Autores: Susanne Albers and Arindam Khan and Leon Ladewig
Publicado en: 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020), Edición 170, 2020, Página(s) 7:1-7:15, ISBN 978-3-95977-159-7
Editor: "Schloss Dagstuhl--Leibniz-Zentrum f{\""u}r Informatik"
DOI: 10.4230/lipics.mfcs.2020.7

Buscando datos de OpenAIRE...

Se ha producido un error en la búsqueda de datos de OpenAIRE

No hay resultados disponibles