scientific article
From MaRDI portal
Publication:2954988
DOI10.4230/LIPICS.STACS.2015.116zbMath1355.68295arXiv1408.7033MaRDI QIDQ2954988
Jesper W. Mikkelsen, Christian Kudahl, Lene Monrad Favrholdt, Joan. Boyar
Publication date: 24 January 2017
Full work available at URL: https://arxiv.org/abs/1408.7033
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
online algorithmsadvice complexitycovering designsasymmetric string guessingadvice complexity class AOC
Analysis of algorithms and problem complexity (68Q25) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Online algorithms; streaming algorithms (68W27)
Related Items (11)
Online-bounded analysis ⋮ Treasure Hunt with Advice ⋮ Optimal Online Edge Coloring of Planar Graphs with Advice ⋮ A Simple PTAS for the Dual Bin Packing Problem and Advice Complexity of Its Online Version ⋮ Online algorithms with advice: the tape model ⋮ Online Bounded Analysis ⋮ Weighted online problems with advice ⋮ Online Minimum Spanning Tree with Advice ⋮ Weighted Online Problems with Advice ⋮ Advice Complexity of the Online Search Problem ⋮ Dynamic node packing
This page was built for publication:
