Sciweavers

97
Voted
APPROX
2006
Springer
72views Algorithms» more  APPROX 2006»
15 years 7 months ago
An Improved Analysis for a Greedy Remote-Clique Algorithm Using Factor-Revealing LPs
Benjamin E. Birnbaum, Kenneth J. Goldman
CASES
2004
ACM
15 years 7 months ago
Translating affine nested-loop programs to process networks
New heterogeneous multiprocessor platforms are emerging that are typically composed of loosely coupled components that exchange data using programmable interconnections. The compon...
Alexandru Turjan, Bart Kienhuis, Ed F. Deprettere
APPROX
2006
Springer
107views Algorithms» more  APPROX 2006»
15 years 7 months ago
A Fast Random Sampling Algorithm for Sparsifying Matrices
We describe a simple random-sampling based procedure for producing sparse matrix approximations. Our procedure and analysis are extremely simple: the analysis uses nothing more th...
Sanjeev Arora, Elad Hazan, Satyen Kale
APPROX
2006
Springer
162views Algorithms» more  APPROX 2006»
15 years 7 months ago
Approximating Precedence-Constrained Single Machine Scheduling by Coloring
Abstract. This paper investigates the relationship between the dimension theory of partial orders and the problem of scheduling precedenceconstrained jobs on a single machine to mi...
Christoph Ambühl, Monaldo Mastrolilli, Ola Sv...
APPROX
2006
Springer
234views Algorithms» more  APPROX 2006»
15 years 7 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ú...