Sciweavers

3894 search results - page 38 / 779
» Approximation Algorithms for Biclustering Problems
Sort
View
SODA
2012
ACM
217views Algorithms» more  SODA 2012»
13 years 8 months ago
Deterministic construction of an approximate M-ellipsoid and its applications to derandomizing lattice algorithms
We give a deterministic O(log n)n -time and space algorithm for the Shortest Vector Problem (SVP) of a lattice under any norm, improving on the previous best deterministic nO(n) -...
Daniel Dadush, Santosh Vempala
STOC
2007
ACM
154views Algorithms» more  STOC 2007»
16 years 6 months ago
Improved approximation for directed cut problems
Amit Agarwal, Noga Alon, Moses Charikar
117
Voted
WADS
2005
Springer
88views Algorithms» more  WADS 2005»
15 years 11 months ago
Approximating the Online Set Multicover Problems via Randomized Winnowing
Piotr Berman, Bhaskar DasGupta
138
Voted
ISAAC
2001
Springer
99views Algorithms» more  ISAAC 2001»
15 years 10 months ago
Tree-Approximations for the Weighted Cost-Distance Problem
Christian Schindelhauer, Birgitta Weber