A ${o}\mathopen {}\left( n\right) \mathclose {}$-Competitive Deterministic Algorithm for Online Matching a Line

Neal Barcelo
Neal Barcelo
Michele Scquizzato
Michele Scquizzato

Algorithmica, pp. 2917-2933, 2019.

Cited by: 0|Bibtex|Views12|Links
Keywords:
Online algorithms Competitive analysis Metric matching Search problems

Abstract:

Online matching on a line involves matching an online stream of requests to a given set of servers, all in the real line, with the objective of minimizing the sum of the distances between matched server-request pairs. The best previously known upper and lower bounds on the optimal deterministic competitive ratio are linear in the number o...More

Code:

Data:

Your rating :
0

 

Tags
Comments