1026 search results - page 21 / 206 » On Finding Minimal w-cutset |
EPS
1998
Springer
14 years 1 months ago
1998
Springer
The task of finding minimal elements of a partially ordered set is a generalization of the task of finding the global minimum of a real-valued function or of finding Pareto-optimal...
STOC
2007
ACM
14 years 9 months ago
2007
ACM
We give a randomized bi-criteria algorithm for the problem of finding a k-dimensional subspace that minimizes the Lp-error for given points, i.e., p-th root of the sum of p-th
ISAAC
1997
Springer
14 years 1 months ago
1997
Springer
We give algorithms to find the optimal disjoint paths around a rectangle. The set of disjoint paths connects a set of sources to a set of sinks (no fixed pairing between the sour...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
We suggest an approach for the enumeration of minimal permutations having d descents which uses skew Young tableaux. We succeed in finding a general expression for the number of s...
EUC
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. We have presented an optimal algorithm for minimal cost loop problem (MCLP), which consists of finding a set of minimum cost loops rooted at a source node. In the MCLP, t...