Distributed weighted vertex cover via maximal matchings

DOI10.1145/1435375.1435381zbMath1445.68164OpenAlexW2055000959MaRDI QIDQ4962764

Fabrizio Grandoni, Alessandro Panconesi, Jochen Könemann

Publication date: 5 November 2018

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1435375.1435381

zbMATH Keywords

approximation algorithmsdistributed algorithmsmaximal matchingvertex cover

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) Approximation algorithms (68W25) Distributed algorithms (68W15)

Related Items (2)

Optimal distributed covering algorithms ⋮ Identifying the parametric occurrence of multiple steady states for some biological networks

This page was built for publication: Distributed weighted vertex cover via maximal matchings