Abstract. We implement the approximation algorithm for the multicast congestion problem in communication networks in [14] based on the fast approximation algorithm for packing prob...
Let p be a rational prime and let Φ(X) be a monic irreducible polynomial in Z[X], with nΦ = deg Φ and δΦ = vp(disc Φ). In [13] Montes describes an algorithm for the decomposi...
Our main result is an optimal online algorithm for preemptive scheduling on uniformly related machines with the objective to minimize makespan. The algorithm is deterministic, yet...
The No-Free-Lunch theorems (NFLTs) are criticized for being too general to be of any relevance to the real world scenario. This paper investigates, both formally and empirically, ...
In this paper, we propose a new asymmetric cryptographic algorithm (HOOD CRYPT) based on the Elliptical Curve Cryptographic approach. The algorithm describes how an orthogonal fre...
Robert Steven Owor, Khalil Dajani, Zephyrinus Okon...