Work

An O(log k log^2 n)-competitive Randomized Algorithm for the k-Sever Problem

Year: 2015

Type: preprint

Abstract: In this paper, we show that there is an O(log k log^2 n)-competitive randomized algorithm for the k-sever problem on any metric space with n points, which improved the previous best competitive ratio O(log^2 k log^3 n log log n) by Nikhil Bansal et al. (FOCS 2011, pages 267-276).

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.1510.07773

Author: Chen, Wenbin

Institutions: Guangzhou University, Nanjing University

Language: English

Topic: Optimization and Search Problems

Subfield: Computer Networks and Communications

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W2238035686

Cites: 24

Cited by:

Related to: 10