Sciweavers

4 search results - page 1 / 1
» Randomly Rounding Rationals with Cardinality Constraints and...
Sort
View
STACS
2007
Springer
13 years 11 months ago
Randomly Rounding Rationals with Cardinality Constraints and Derandomizations
: If you can round {0, 1 2} vectors nicely, then all rational vectors.
Benjamin Doerr
WEA
2010
Springer
250views Algorithms» more  WEA 2010»
13 years 10 months ago
Randomized Rounding for Routing and Covering Problems: Experiments and Improvements
We investigate how the recently developed different approaches to generate randomized roundings satisfying disjoint cardinality constraints behave when used in two classical algori...
Benjamin Doerr, Marvin Künnemann, Magnus Wahl...
STACS
2005
Springer
13 years 10 months ago
Roundings Respecting Hard Constraints
We provide a deterministic algorithm that constructs small point sets exhibiting a low star discrepancy. The algorithm is based on recent results on randomized roundings respectin...
Benjamin Doerr
STOC
1993
ACM
123views Algorithms» more  STOC 1993»
13 years 9 months ago
Constructing small sample spaces satisfying given constraints
Abstract. The subject of this paper is nding small sample spaces for joint distributions of n discrete random variables. Such distributions are often only required to obey a certa...
Daphne Koller, Nimrod Megiddo