306 search results - page 34 / 62 » Parallel approximation algorithms for facility-location prob... |
223
Voted
DC
2011
14 years 3 months ago
2011
Abstract This paper gives poly-logarithmic-round, distributed δ-approximation algorithms for covering problems with submodular cost and monotone covering constraints (Submodular-c...
122
Voted
PADS
1999
ACM
15 years 8 months ago
1999
ACM
Most work to date in parallel and distributed discrete event simulation is based on assigning precise time stamps to events, and time stamp order event processing. An alternative ...
152
Voted
CONCUR
1999
Springer
15 years 8 months ago
1999
Springer
d abstract) Christel Baiera, Joost-Pieter Katoenb;c and Holger Hermannsc aLehrstuhl fur Praktische Informatik II, University of Mannheim 68131 Mannheim, Germany bLehrstuhl fur Info...
130
click to vote
IPPS
2009
IEEE
15 years 10 months ago
2009
IEEE
In this paper, we deal with the large-scale divisible load problem studied in [12]. We show how to reduce this problem to a classical preemptive scheduling problem on a single mac...
143
Voted
DAGM
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. Graph cuts have become very popular in many areas of computer vision including segmentation, energy minimization, and 3D reconstruction. Their ability to find optimal res...