A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
A Collection of Lower Bounds for Online Matching on the Line
[chapter]

2018
*
Lecture Notes in Computer Science
*

In the online matching on the line problem, the task is to match a set of requests R online to a given set of servers S. The distance metric between any two points in R ∪ S is a line metric and the objective for the online algorithm is to minimize the sum of distances between matched server-request pairs. This problem is well-studied and -despite recent improvements -there is still a large gap between the best known lower and upper bounds: The best known deterministic algorithm for the problem

doi:10.1007/978-3-319-77404-6_5
fatcat:qmscmph4f5dmnleloysxynbk7y