The search result changed since you submitted your search request. Documents might be displayed in a different sort order.
  • search hit 2811 of 3482
Back to Result List

Randomized online computation with high probability guarantees

  • We study the relationship between the competitive ratio and the tail distribution of randomized online problems. To this end, we identify a broad class of online problems for which the existence of a randomized online algorithm with constant expected competitive ratio r implies the existence of a randomized online algorithm that has a competitive ratio of (1+ε)r with high probability, measured with respect to the optimal profit or cost, respectively. The class of problems includes some of the well-studied online problems such as paging, k-server, and metrical task systems on finite metric spaces.

Download full text files

Export metadata

Statistics

Number of document requests

Additional Services

Share in Twitter Search Google Scholar
Metadaten
Author:Tobias MömkeORCiDGND, Rastislav Královič, Richard Královič, Dennis Komm
URN:urn:nbn:de:bvb:384-opus4-870205
Frontdoor URLhttps://opus.bibliothek.uni-augsburg.de/opus4/87020
Parent Title (English):Algorithmica
Publisher:Springer
Place of publication:Berlin
Type:Article
Language:English
Date of Publication (online):2021/05/21
Year of first Publication:2022
Publishing Institution:Universität Augsburg
Release Date:2021/05/25
Volume:84
Issue:5
First Page:1357
Last Page:1384
DOI:https://doi.org/10.1007/s00453-022-00925-z
Institutes:Fakultät für Angewandte Informatik
Fakultät für Angewandte Informatik / Institut für Informatik
Fakultät für Angewandte Informatik / Institut für Informatik / Professur für Theoretische Informatik / Resource Aware Algorithmics
Dewey Decimal Classification:0 Informatik, Informationswissenschaft, allgemeine Werke / 00 Informatik, Wissen, Systeme / 004 Datenverarbeitung; Informatik
Licence (German):License LogoCC-BY 4.0: Creative Commons: Namensnennung (mit Print on Demand)