31 search results - page 2 / 7 » Sequential and Parallel Algorithms for Mixed Packing and Cov... |
136
Voted
SIAMCOMP
1998
15 years 2 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...
159
Voted
PODC
2009
ACM
16 years 3 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...
157
click to vote
SPAA
2010
ACM
15 years 7 months ago
2010
ACM
We present a distributed algorithm that finds a maximal edge packing in O(∆ + log∗ W) synchronous communication rounds in a weighted graph, independent of the number of nodes...
135
Voted
ESA
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. Minimizing the makespan or maximizing the minimum machine load are two of the most important and fundamental parallel machine scheduling problems. In an online scenario, ...
126
Voted
ICDCS
2010
IEEE
15 years 2 months ago
2010
IEEE
—Large-scale distributed cyber-physical systems will have many sensors/actuators (each with local micro-controllers), and a distributed communication/computing backbone with mult...