841 search results - page 20 / 169 » Approximability of Minimum AND-Circuits |
SODA
2003
ACM
13 years 10 months ago
2003
ACM
We give a simple algorithm for the MINIMUM DIRECTED MULTICUT problem, and show that it gives an Ç´ÔÒµapproximation. This improves on the previous approximation guarantee of ...
SODA
1997
ACM
13 years 10 months ago
1997
ACM
We study graph partitioning problems on graphs with edge capacities and vertex weights. The problems of b-balanced cuts and k-balanced partitions are unified into a new problem ca...
IJAR
2010
13 years 7 months ago
2010
The present article considers estimating a parameter θ in an imprecise probability model (Pθ)θ∈Θ which consists of coherent upper previsions Pθ . After the definition of a...
SODA
2004
ACM
13 years 10 months ago
2004
ACM
For a rectilinear Steiner tree T with a root, define its k-th moment Mk(T) = T (dT (u))k du, where the integration is over all edges of T, dT (u) is the length of the unique path ...
ML
2012
ACM
12 years 4 months ago
2012
ACM
Bayesian learning, widely used in many applied data-modeling problems, is often accomplished with approximation schemes because it requires intractable computation of the posterio...