Sciweavers

3874 search results - page 131 / 775
» Approximation Algorithms for k-hurdle Problems
Sort
View
APPROX
2006
Springer
234views Algorithms» more  APPROX 2006»
15 years 1 months ago
Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs
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...
Christoph Ambühl, Thomas Erlebach, Matú...
ESCAPE
2007
Springer
266views Algorithms» more  ESCAPE 2007»
15 years 4 months ago
CR-precis: A Deterministic Summary Structure for Update Data Streams
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 ...
Sumit Ganguly, Anirban Majumder
JPDC
2007
81views more  JPDC 2007»
14 years 9 months ago
Improved scheduling in rings
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....
Dekel Tsur
WADS
2007
Springer
140views Algorithms» more  WADS 2007»
15 years 4 months ago
A Stab at Approximating Minimum Subadditive Join
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...
Staal A. Vinterbo
WADS
2009
Springer
378views Algorithms» more  WADS 2009»
15 years 4 months ago
Two for One: Tight Approximation of 2D Bin Packing
In this paper, we study the two-dimensional geometrical bin packing problem (2DBP): given a list of rectangles, provide a packing of all these into the smallest possible number of ...
Klaus Jansen, Lars Prädel, Ulrich M. Schwarz