Franziska Eberle

Publication Activity (10 Years)

Years Active: 2018-2024
Publications (10 Years): 23

Top Topics

Knapsack Problem

Top Venues

Oper. Res. Lett.

Publications

Moritz Buchem, Franziska Eberle, Hugo Kooki Kasuya Rosado, Kevin Schewior, Andreas Wiese
Scheduling on a Stochastic Number of Machines. CoRR (2024)
Franziska Eberle
O(1/ε) Is the Answer in Online Weighted Throughput Maximization. STACS (2024)
Franziska Eberle, Felix Hommelsheim, Alexander Lindermayr, Zhenwei Liu, Nicole Megow, Jens Schlöter
Accelerating Matroid Optimization through Fast Imprecise Oracles. CoRR (2024)
Franziska Eberle, Ruben Hoeksma, Nicole Megow, Lukas Nölke, Kevin Schewior, Bertrand Simon
Speed-robust scheduling: sand, bricks, and rocks. Math. Program. 197 (2) (2023)
Franziska Eberle
O(1/ε) is the answer in online weighted throughput maximization. CoRR (2023)
Franziska Eberle, Nicole Megow, Kevin Schewior
Online Throughput Maximization on Unrelated Machines: Commitment is No Burden. ACM Trans. Algorithms 19 (1) (2023)
Franziska Eberle, Anupam Gupta, Nicole Megow, Benjamin Moseley, Rudy Zhou
Configuration Balancing for Stochastic Requests. IPCO (2023)
Sebastian Berndt, Franziska Eberle, Nicole Megow
Online load balancing with general reassignment cost. Oper. Res. Lett. 50 (3) (2022)
Franziska Eberle, Anupam Gupta, Nicole Megow, Benjamin Moseley, Rudy Zhou
Configuration Balancing for Stochastic Requests. CoRR (2022)
Franziska Eberle, Alexander Lindermayr, Nicole Megow, Lukas Nölke, Jens Schlöter
Robustification of Online Graph Exploration Methods. AAAI (2022)
Franziska Eberle
Optimally handling commitment issues in online throughput maximization. ISAIM (2022)
Franziska Eberle, Alexander Lindermayr, Nicole Megow, Lukas Nölke, Jens Schlöter
Robustification of Online Graph Exploration Methods. CoRR (2021)
Franziska Eberle, Nicole Megow, Lukas Nölke, Bertrand Simon, Andreas Wiese
Fully Dynamic Algorithms for Knapsack Problems with Polylogarithmic Update Time. FSTTCS (2021)
Franziska Eberle
Scheduling and Packing Under Uncertainty. OR (2021)
Franziska Eberle, Ruben Hoeksma, Nicole Megow, Lukas Nölke, Kevin Schewior, Bertrand Simon
Speed-Robust Scheduling - Sand, Bricks, and Rocks. IPCO (2021)
Martin Böhm, Franziska Eberle, Nicole Megow, Lukas Nölke, Jens Schlöter, Bertrand Simon, Andreas Wiese
Fully Dynamic Algorithms for Knapsack Problems with Polylogarithmic Update Time. CoRR (2020)
Franziska Eberle, Ruben Hoeksma, Nicole Megow, Lukas Nölke, Kevin Schewior, Bertrand Simon
Speed-Robust Scheduling. CoRR (2020)
Franziska Eberle, Nicole Megow, Kevin Schewior
Optimally Handling Commitment Issues in Online Throughput Maximization. ESA (2020)
Lin Chen, Franziska Eberle, Nicole Megow, Kevin Schewior, Clifford Stein
A general framework for handling commitment in online throughput maximization. Math. Program. 183 (1) (2020)
Lin Chen, Franziska Eberle, Nicole Megow, Kevin Schewior, Cliff Stein
A General Framework for Handling Commitment in Online Throughput Maximization. IPCO (2019)
Franziska Eberle, Nicole Megow, Kevin Schewior
Optimally handling commitment issues in online throughput maximization. CoRR (2019)
Franziska Eberle, Felix A. Fischer, Jannik Matuschke, Nicole Megow
On index policies for stochastic minsum scheduling. Oper. Res. Lett. 47 (3) (2019)
Lin Chen, Franziska Eberle, Nicole Megow, Kevin Schewior, Cliff Stein
A general framework for handling commitment in online throughput maximization. CoRR (2018)