805 search results - page 6 / 161 » Combinatorial optimization problems in self-assembly |
EOR
2007
13 years 9 months ago
2007
This paper investigates, for the first time in the literature, the approximation of minmax (regret) versions of classical problems like shortest path, minimum spanning tree, and ...
SODA
2008
ACM
13 years 11 months ago
2008
ACM
In this paper, we study online algorithms when the input is not chosen adversarially, but consists of draws from some given probability distribution. While this model has been stu...
SBACPAD
2005
IEEE
14 years 3 months ago
2005
IEEE
ORL
2010
13 years 4 months ago
2010
We show how we can linearize probabilistic linear constraints with binary variables when all coefficients are distributed according to either N(
EUSFLAT
2009
13 years 7 months ago
2009