Abstract
We study the online unweighted b-matching problem where at most b≥1 requests can be matched to any server site. We present a deterministic algorithm Balance whose competitive ratio is (Formula Presented). We show that the competitive ratio of every deterministic online algorithm is at least (Formula Presented). Hence, Balance is optimally competitive, including low order terms. For large b, the competitive ratio of Balance approaches (Formula Presented).
Cite
CITATION STYLE
Kalyanasundaram, B., & Pruhs, K. (1996). An optimal deterministic algorithm for online b-matching. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1180, pp. 193–199). Springer Verlag. https://doi.org/10.1007/3-540-62034-6_49
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
