25 results on '"Franziska Eberle"'
Search Results
2. O(1/ε) Is the Answer in Online Weighted Throughput Maximization.
3. A Tight (3/2 + ε)-Approximation Algorithm for Demand Strip Packing.
4. Scheduling on a Stochastic Number of Machines.
5. Accelerating Matroid Optimization through Fast Imprecise Oracles.
6. Configuration Balancing for Stochastic Requests.
7. Online Throughput Maximization on Unrelated Machines: Commitment is No Burden.
8. Speed-robust scheduling: sand, bricks, and rocks.
9. Robustification of Online Graph Exploration Methods.
10. Online load balancing with general reassignment cost.
11. O(1/ε) is the answer in online weighted throughput maximization.
12. Fully Dynamic Algorithms for Knapsack Problems with Polylogarithmic Update Time.
13. Speed-Robust Scheduling - Sand, Bricks, and Rocks.
14. Scheduling and Packing Under Uncertainty.
15. Optimally Handling Commitment Issues in Online Throughput Maximization.
16. Optimally handling commitment issues in online throughput maximization.
17. A General Framework for Handling Commitment in Online Throughput Maximization.
18. A general framework for handling commitment in online throughput maximization.
19. Configuration Balancing for Stochastic Requests.
20. On index policies for stochastic minsum scheduling.
21. Robustification of Online Graph Exploration Methods.
22. Speed-Robust Scheduling.
23. Fully Dynamic Algorithms for Knapsack Problems with Polylogarithmic Update Time.
24. Optimally handling commitment issues in online throughput maximization.
25. A general framework for handling commitment in online throughput maximization.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.