Abstract. We consider the randomized k-server problem, and give improved results for various metric spaces. In particular, we extend a recent result of Cot
We study approximation solutions for the densest k-subgraph problem (DS-k) on several classes of intersection graphs. We adopt the concept of -quasi elimination orders, introduced ...
In this work we present a software simulator for the performance evaluation of the NDSA (Normalized Differential Spectral Absorption) method at global scale assuming a realistic s...