Online bottleneck matching on a line

Man Xiao, Shu Zhao, Weidong Li () and Jinhua Yang
Additional contact information
Man Xiao: Yunnan University
Shu Zhao: Yunnan University
Weidong Li: Yunnan University
Jinhua Yang: Dianchi College

Journal of Combinatorial Optimization, 2023, vol. 45, issue 4, No 13, 17 pages

Abstract: Abstract We study the online bottleneck matching problem on a line, which is to match a sequence of m requests arriving one-by-one in an online fashion to a given set of m servers, such that each server is matched exactly once and the maximum distance between any request and its server is minimized. When the distances between any two adjacent servers are the same, we present an optimal online algorithm with a competitive ratio of $$m+1$$ m + 1 . When $$m=3$$ m = 3 , we present an optimal online algorithm whose competitive ratio is determined by the relative distance between adjacent servers and no more than $$3+\sqrt{2}$$ 3 + 2 , which matches the previous best lower bound proposed thirty years ago.

Keywords: Online bottleneck matching; Online algorithm; Competitive ratio (search for similar items in EconPapers)
Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-023-01036-3 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:45:y:2023:i:4:d:10.1007_s10878-023-01036-3

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-023-01036-3

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().