25 search results - page 2 / 5 » siamcomp 1998 |
102
click to vote
SIAMCOMP
1998
14 years 11 months ago
1998
We build on the classical greedy sequential set cover algorithm, in the spirit of the primal-dual schema, to obtain simple parallel approximation algorithms for the set cover probl...
101
click to vote
SIAMCOMP
1998
14 years 11 months ago
1998
We present a consensus algorithm that combines unreliable failure detection and randomization, two well-known techniques for solving consensus in asynchronous systems with crash f...
110
click to vote
SIAMCOMP
1998
14 years 11 months ago
1998
This paper introduces a near-linear time sequential algorithm for constructing a sparse neighborhood cover. This implies analogous improvements (from quadratic to near-linear time)...
SIAMCOMP
1998
14 years 11 months ago
1998
This paper first presents a unified approach to design efficient algorithms for the weighted domination problem and its three variants, i.e., the weighted independent, connected,...
SIAMCOMP
1998
14 years 11 months ago
1998
Hypercubic sorting networks are a class of comparator networks whose structure maps e ciently to the hypercube and any of its bounded degree variants. Recently, n-input hypercubic...