Search Sciweavers | Sciweavers

3894 search results - page 38 / 779

» Approximation Algorithms for Biclustering Problems

100

click to vote

SODA
2012
ACM

217views Algorithms» more SODA 2012»

Deterministic construction of an approximate M-ellipsoid and its applications to derandomizing lattice algorithms

13 years 2 months ago

Download www2.isye.gatech.edu

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

claim paper

Read More »

click to vote

STOC
2007
ACM

154views Algorithms» more STOC 2007»

Improved approximation for directed cut problems

16 years 3 days ago

Download www.math.tau.ac.il

Amit Agarwal, Noga Alon, Moses Charikar

claim paper

Read More »

click to vote

WADS
2005
Springer

88views Algorithms» more WADS 2005»

Approximating the Online Set Multicover Problems via Randomized Winnowing

15 years 5 months ago

Download www.cs.uic.edu

Piotr Berman, Bhaskar DasGupta

claim paper

Read More »

click to vote

ISAAC
2001
Springer

99views Algorithms» more ISAAC 2001»

Tree-Approximations for the Weighted Cost-Distance Problem

15 years 4 months ago

Download cone.informatik.uni-freiburg.de

Christian Schindelhauer, Birgitta Weber

claim paper

Read More »

click to vote

STOC
1989
ACM

66views Algorithms» more STOC 1989»

The Minimum Consistent DFA Problem Cannot Be Approximated within any Polynomial

15 years 3 months ago

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers