A Primal-Dual Parallel Approximation Technique Applied to Weighted Set and Vertex Covers
From MaRDI portal
Publication:4312226
DOI10.1006/jagm.1994.1036zbMath0938.68946arXivcs/0205037OpenAlexW2029483371MaRDI QIDQ4312226
Neal E. Young, Samir Khuller, Uzi Vishkin
Publication date: 30 November 1994
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/cs/0205037
Abstract computational complexity for mathematical programming problems (90C60) Linear programming (90C05) Combinatorics in computer science (68R05) Parallel algorithms in computer science (68W10) Combinatorial aspects of packing and covering (05B40)
Related Items (7)
Parallel algorithm for minimum partial dominating set in unit disk graph ⋮ Parallel algorithms for minimum general partial dominating set and maximum budgeted dominating set in unit disk graph ⋮ Optimal distributed covering algorithms ⋮ Distributed algorithms for covering, packing and maximum weighted matching ⋮ Parallel approximation for partial set cover ⋮ Approximation algorithms in combinatorial scientific computing ⋮ Set cover problems with small neighborhood covers
This page was built for publication: A Primal-Dual Parallel Approximation Technique Applied to Weighted Set and Vertex Covers
