RKRichard Královič
Richard Královič
*This is an algorithmically generated author record based on publicly available information.
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Richard Královič has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Dennis Komm
ETH Zurich, Zurich, Switzerland
2 shared publications - Hans-Joachim Böckenhauer
Department of Computer Science, ETH Zurich, Zurich, Switzerland
2 shared publications - Tobias Mömke
ETH Zurich
2 shared publications - Anna Zych
ETH Zurich
1 shared publication - Davide Bilò
University of L'Aquila
1 shared publication - Juraj Hromkovič
ETH Zurich
1 shared publication
Latest Publications
- Open Access
- 30 January 2022
- Published by Springer Nature in Algorithmica
- Vol. 84 (5) , 1357-1384
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+\varepsilon )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.- 30 January 2022
- Published by Springer Nature in Algorithmica
- Vol. 84 (5) , 1357-1384
Open AccessRandomized 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+\varepsilon )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. - 15 June 2010
- Published by Springer Nature in Algorithmica
- Vol. 61 (2) , 227-251
Reoptimization of the Shortest Common Superstring Problem
- 15 June 2010
- Published by Springer Nature in Algorithmica
- Vol. 61 (2) , 227-251
Reoptimization of the Shortest Common Superstring Problem
- 5 May 2008
- Published by Elsevier in Theoretical Computer Science
- Vol. 410 (36) , 3428-3435
Reoptimization of Steiner trees: Changing the terminal set
- 5 May 2008
- Published by Elsevier in Theoretical Computer Science
- Vol. 410 (36) , 3428-3435
Reoptimization of Steiner trees: Changing the terminal set