A primal–dual online algorithm for the k-server problem on weighted HSTs
Sign Up to like & getrecommendations! Published in 2017 at "Journal of Combinatorial Optimization"
DOI: 10.1007/s10878-017-0135-z
Abstract: In this paper, we show that there is a $$\frac{5}{2}\ell \cdot \ln (1+k)$$52ℓ·ln(1+k)-competitive randomized algorithm for the k-sever problem on weighted Hierarchically Separated Trees (HSTs) with depth $$\ell $$ℓ when $$n=k+1$$n=k+1 where n is the… read more here.
Keywords: online algorithm; algorithm; dual online; problem weighted ... See more keywords
Combinatorial Algorithms for the Uniform-Cost Inverse 1-Center Problem on Weighted Trees
Sign Up to like & getrecommendations! Published in 2018 at "Acta Mathematica Vietnamica"
DOI: 10.1007/s40306-018-0286-8
Abstract: Inverse 1-center problem on a network is to modify the edge lengths or vertex weights within certain bounds so that the prespecified vertex becomes an (absolute) 1-center of the perturbed network and the modifying cost… read more here.
Keywords: center problem; inverse center; problem weighted; center ... See more keywords