Near Optimal Algorithms for Online Maximum Weighted b-Matching

DOI10.1007/978-3-319-08016-1_22zbMath1407.68563OpenAlexW272710231MaRDI QIDQ3188852

H. F. Ting, Xiangzhong Xiang

Publication date: 2 September 2014

Published in: Frontiers in Algorithmics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-08016-1_22

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Randomized algorithms (68W20) Online algorithms; streaming algorithms (68W27)

This page was built for publication: Near Optimal Algorithms for Online Maximum Weighted b-Matching