A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is `application/pdf`

.

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

2009
*
Proceedings of the 28th ACM symposium on Principles of distributed computing - PODC '09
*

The paper presents distributed and parallel -approximation algorithms for covering problems, where is the maximum number of variables on which any constraint depends (for example, = 2 for vertex cover). Specific results include the following. • For weighted vertex cover, the first distributed 2-approximation algorithm taking O(log n) rounds and the first parallel 2-approximation algorithm in RNC. The algorithms generalize to covering mixed integer linear programs (CMIP) with two variables per

doi:10.1145/1582716.1582746
dblp:conf/podc/KoufogiannakisY09
fatcat:6ith2bn5irevdpyfc3ahngwfpa