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.

Saved in:
Bibliographic Details
Published in:Operations research letters Vol. 51; no. 6; pp. 591 - 594
Main Authors: Kalyanasundaram, Bala, Pruhs, Kirk, Stein, Cliff
Format: Journal Article
Language:English
Published: Elsevier B.V 01.11.2023
Subjects:
Matching
Metric matching
Online algorithms
Matching
Online algorithms
Metric matching
ISSN:0167-6377, 1872-7468
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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