Finite-State Online Algorithms and Their Automated Competitive Analysis
From MaRDI portal
Publication:5459103
Recommendations
Cited in
(10)- 2D knapsack: packing squares
- Formal Analysis of Online Algorithms
- Randomized Competitive Analysis for Two-Server Problems
- Online knapsack problem under concave functions
- Reasoning about online algorithms with weighted automata
- Online minimization knapsack problem
- Online Knapsack Problem Under Concave Functions
- Randomized competitive analysis for two server problems
- 2D knapsack: packing squares
- Online removable knapsack with limited cuts
This page was built for publication: Finite-State Online Algorithms and Their Automated Competitive Analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5459103)