10 results on '"Franziska Eberle"'
Search Results
2. O(1/ε) Is the Answer in Online Weighted Throughput Maximization.
3. Configuration Balancing for Stochastic Requests.
4. Robustification of Online Graph Exploration Methods.
5. Fully Dynamic Algorithms for Knapsack Problems with Polylogarithmic Update Time.
6. Speed-Robust Scheduling - Sand, Bricks, and Rocks.
7. Scheduling and Packing Under Uncertainty.
8. Optimally Handling Commitment Issues in Online Throughput Maximization.
9. Optimally handling commitment issues in online throughput maximization.
10. 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.