196 search results - page 5 / 40 » Approximating weighted matchings in parallel |
115
click to vote
PODC
2009
ACM
15 years 10 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...
106
click to vote
COCOON
2007
Springer
15 years 3 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...
ALGORITHMICA
2005
14 years 9 months ago
2005
We present a new bit-parallel technique for approximate string matching. We build on two previous techniques. The first one, BPM [Myers, J. of the ACM, 1999], searches for a patte...
113
click to vote
WEA
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. Bit-parallelism permits executing several operations simultaneously over a set of bits or numbers stored in a single computer word. This technique permits searching for t...
SPIRE
2000
Springer
15 years 1 months ago
2000
Springer