102 search results - page 1 / 21 » Distributed Approximation Algorithms for Weighted Problems i... |
COCOON
2007
Springer
13 years 10 months ago
2007
Springer
We give efficient distributed approximation algorithms for weighted versions of the maximum matching problem and the minimum dominating set problem for graphs from minor-closed fam...
ESA
2006
Springer
13 years 8 months ago
2006
Springer
PODC
2009
ACM
14 years 5 months ago
2009
ACM
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...
MOC
2002
13 years 4 months ago
2002
In this paper, we present several baby-step giant-step algorithms for the low hamming weight discrete logarithm problem. In this version of the discrete log problem, we are require...
PPAM
2007
Springer
13 years 10 months ago
2007
Springer
Abstract. We consider the problem of computing a weighted edge matching in a large graph using a parallel algorithm. This problem has application in several areas of combinatorial ...