Finite-State Online Algorithms and Their Automated Competitive Analysis
From MaRDI portal
Publication:5459103
DOI10.1007/11940128_9zbMATH Open1135.68651OpenAlexW1542158143MaRDI QIDQ5459103FDOQ5459103
Authors: Takashi Horiyama, Jun Kawahara, Kazuo Iwama
Publication date: 24 April 2008
Published in: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11940128_9
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
Uses Software
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)