Distributed and parallel algorithms for weighted vertex cover and other covering problems

DOI10.1145/1582716.1582746zbMath1291.05160OpenAlexW1965897365MaRDI QIDQ5170314

Neal E. Young, Christos Koufogiannakis

Publication date: 23 July 2014

Published in: Proceedings of the 28th ACM symposium on Principles of distributed computing (Search for Journal in Brave)

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

zbMATH Keywords

distributed coveringdistributed vertex cover

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Parallel algorithms in computer science (68W10) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Distributed algorithms (68W15)

Related Items (4)

Fast primal-dual distributed algorithms for scheduling and matching problems ⋮ Approximability of sparse integer programs ⋮ Greedy \(\varDelta \)-approximation algorithm for covering with arbitrary constraints and submodular cost ⋮ Distributed algorithms for covering, packing and maximum weighted matching

This page was built for publication: Distributed and parallel algorithms for weighted vertex cover and other covering problems