Computer Science – Data Structures and Algorithms
Scientific paper
2002-05-18
Journal of Algorithms 17(2):280-289 (1994)
Computer Science
Data Structures and Algorithms
conference version appeared in IPCO'93
Scientific paper
The paper describes a simple deterministic parallel/distributed
(2+epsilon)-approximation algorithm for the minimum-weight vertex-cover problem
and its dual (edge/element packing).
Khuller Samir
Vishkin Uzi
Young Neal
No associations
LandOfFree
A Primal-Dual Parallel Approximation Technique Applied to Weighted Set and Vertex Cover does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A Primal-Dual Parallel Approximation Technique Applied to Weighted Set and Vertex Cover, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Primal-Dual Parallel Approximation Technique Applied to Weighted Set and Vertex Cover will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-599140