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

Algorithmica, pp. 1-17, 2019.

Cited by: 0|Bibtex|Views7|Links
EI
Keywords:
Competitive analysis Metric matching Online algorithms 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