Weighted Matchings via Unweighted Augmentations
From MaRDI portal
Publication:5145261
DOI10.1145/3293611.3331603OpenAlexW2963298291MaRDI QIDQ5145261
Slobodan Mitrović, Ola Svensson, Buddhima Gamlath, Sagar Kale
Publication date: 20 January 2021
Published in: Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1811.02760
Related Items
Maliciously secure massively parallel computation for all-but-one corruptions, (1- ϵ )-Approximate Maximum Weighted Matching in poly(1/ ϵ , log n ) Time in the Distributed and Parallel Settings