Randomized approximation algorithms in combinatorial optimization

In this paper we first prove the following combinatorial bound, concerning the complexity of the vertical decomposition of the minimization diagram of trivariate functions: Let $$\mathcal{F}$$ be a collection ofn totally or partially defined algebraic ...

This paper presents a parallel randomized algorithm which computes a pair of @e-optimal strategies for a given (m,n)-matrix game A = [a"i"j] @e [-1, 1] in O(@e^-^2log^2(n+m)) expected time on an (n+m)/log(n+m)-processor EREW PRAM. For any fixed accuracy ...

We present space-efficient parallel strategies for two fundamental combinatorial search problems, namely, backtrack search and branch-and-bound, both involving the visit of an n -node tree of height h under the assumption that a node can be accessed ...