Primal-dual based distributed algorithms for vertex cover with semi-hard capacities

DOI10.1145/1073814.1073835zbMATH Open1314.68156OpenAlexW2026210405MaRDI QIDQ5177233

Could not fetch data.

Publication date: 10 March 2015

Published in: Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)

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

zbMATH Keywords

approximation algorithmsdistributed algorithmsvertex coverprimal-dual algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Distributed algorithms (68W15)

Related Items (4)

Distributed approximation of capacitated dominating sets ⋮ Distributed algorithms for covering, packing and maximum weighted matching ⋮ Efficient distributed approximation algorithms via probabilistic tree embeddings ⋮ Primal-dual based distributed approximation algorithm for Prize-collecting Steiner tree

This page was built for publication: Primal-dual based distributed algorithms for vertex cover with semi-hard capacities

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5177233)