Finite-State Online Algorithms and Their Automated Competitive Analysis
From MaRDI portal
Publication:5459103
DOI10.1007/11940128_9zbMath1135.68651OpenAlexW1542158143MaRDI QIDQ5459103
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
Related Items (8)
Randomized competitive analysis for two server problems ⋮ 2D knapsack: packing squares ⋮ Online removable knapsack with limited cuts ⋮ Online minimization knapsack problem ⋮ Randomized Competitive Analysis for Two-Server Problems ⋮ Online Knapsack Problem Under Concave Functions ⋮ 2D Knapsack: Packing Squares ⋮ Online knapsack problem under concave functions
Uses Software
This page was built for publication: Finite-State Online Algorithms and Their Automated Competitive Analysis
