3875 search results - page 163 / 775 » Approximation algorithms for the 0-extension problem |
208
Voted
APPROX
2006
Springer
15 years 8 months ago
2006
Springer
For a given graph with weighted vertices, the goal of the minimum-weight dominating set problem is to compute a vertex subset of smallest weight such that each vertex of the graph...
161
click to vote
ESCAPE
2007
Springer
15 years 11 months ago
2007
Springer
We present deterministic sub-linear space algorithms for a number of problems over update data streams, including, estimating frequencies of items and ranges, finding approximate ...
136
click to vote
JPDC
2007
15 years 4 months ago
2007
We study the problem of scheduling unit size jobs on n processors connected by a ring. We show a distributed algorithm for this problem with an approximation ratio of 3 2 + √ 2....
203
click to vote
EC
2011
14 years 12 months ago
2011
Abstract—In the field of evolutionary multi-criterion optimization, the hypervolume indicator is the only single set quality measure that is known to be strictly monotonic with ...
132
click to vote
WADS
2007
Springer
15 years 11 months ago
2007
Springer
Let (L, ∗) be a semilattice, and let c : L → [0, ∞) be monotone and increasing on L. We state the Minimum Join problem as: given size n sub-collection X of L and integer k w...