Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

98

Voted

STACS
2007
Springer

97views Theoretical Computer Science» more STACS 2007»

Randomly Rounding Rationals with Cardinality Constraints and Derandomizations

15 years 9 months ago

Randomly Rounding Rationals with Cardinality Constraints and Derandomizations

Download www.mpi-inf.mpg.de

: If you can round {0, 1 2} vectors nicely, then all rational vectors.

Benjamin Doerr

Real-time Traffic

Rational Vectors | STACS 2007 | Theoretical Computer Science |

claim paper

Related Content

» Randomized Rounding for Routing and Covering Problems Experiments and Improvements

» Roundings Respecting Hard Constraints

» Constructing small sample spaces satisfying given constraints

Post Info
More Details (n/a)

Added	09 Jun 2010
Updated	09 Jun 2010
Type	Conference
Year	2007
Where	STACS
Authors	Benjamin Doerr

Comments (0)