Zobrazeno 1 - 10
of 40
pro vyhledávání: '"Matějka, Josef"'
Autor:
Koucký, Michal, Matějka, Josef
In this paper we consider sorting in the cache-oblivious model of Frigo, Leiserson, Prokop, and Ramachandran (1999). We introduce a new simple sorting algorithm in that model which has asymptotically optimal IO complexity $O(\frac{n}{B} \log_{M/B} n)
Externí odkaz:
http://arxiv.org/abs/2407.14801
In the Euclidean Steiner Tree problem, we are given as input a set of points (called terminals) in the $\ell_2$-metric space and the goal is to find the minimum-cost tree connecting them. Additional points (called Steiner points) from the space can b
Externí odkaz:
http://arxiv.org/abs/2312.01252
In this paper we shed more light on determinants of interval matrices. Computing the exact bounds on a determinant of an interval matrix is an NP-hard problem. Therefore, attention is first paid to approximations. NP-hardness of both relative and abs
Externí odkaz:
http://arxiv.org/abs/1809.03736