A randomized algorithm for online metric b-matching

We give a randomized algorithm for online metric b-matching that is O(log2⁡k) competitive, where k is the number of server locations, by giving a black box reduction from b-matching on a hierarchically separated tree to a uniform metric space.

Uložené v:
Podrobná bibliografia
Vydané v:Operations research letters Ročník 51; číslo 6; s. 591 - 594
Hlavní autori: Kalyanasundaram, Bala, Pruhs, Kirk, Stein, Cliff
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Elsevier B.V 01.11.2023
Predmet:
Matching
Metric matching
Online algorithms
Matching
Online algorithms
Metric matching
ISSN:0167-6377, 1872-7468
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:We give a randomized algorithm for online metric b-matching that is O(log2⁡k) competitive, where k is the number of server locations, by giving a black box reduction from b-matching on a hierarchically separated tree to a uniform metric space.
ISSN:0167-6377
1872-7468
DOI:10.1016/j.orl.2023.09.002