We introduce the online bottleneck semi-matching (OBSM) problem, which is to assign a sequence of requests to a given set of m servers, such that the maximum cost is minimized.
Dec 11, 2021
Sep 30, 2024 · We present a lower bound m + 1 and an online algorithm with competitive ratio 2 m − 1 for the OBSM problem on a line, where the distance ...
We present a lower bound m + 1 and an online algorithm with competitive ratio 2 m - 1 for the OBSM problem on a line, where the distance between every pair of ...
Online Bottleneck Semi-matching | Request PDF - ResearchGate
www.researchgate.net › ... › Competition
Nov 21, 2024 · We introduce the online bottleneck semi-matching (OBSM) problem, which is to assign a sequence of requests to a given set of m servers, ...
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 ...
We consider the online bottleneck matching problem, where k server-vertices lie in a metric space and k request-vertices that arrive over time each must ...
Abstract. We consider the online bottleneck matching problem, where k server- vertices lie in a metric space and k request-vertices that arrive over time ...
Missing: Semi- | Show results with:Semi-
We consider the online bottleneck matching problem, where $$k$$ server-vertices lie in a metric space and $$k$$ request-vertices that arrive over time each ...
Dec 9, 2022 · Xiao and Li [17] considered the semi-matching problem with two heterogeneous sensors, and proposed two optimal online algorithms. In this paper, ...
Online bottleneck matching on a line | Request PDF - ResearchGate
www.researchgate.net › ... › Server
Oct 22, 2024 · We introduce the online bottleneck semi-matching (OBSM) problem, which is to assign a sequence of requests to a given set of m servers, such ...