603 search results - page 6 / 121 » A General Approximation Technique for Constrained Forest Pro... |
APPROX
2008
Springer
14 years 11 months ago
2008
Springer
Let H be a graph, and let CH(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating CH(G). Previous res...
NETWORKS
2010
14 years 7 months ago
2010
We consider a probabilistic model for the Steiner Tree problem. Under this model the problem is defined in a 2-stage setting over a first-stage complete weighted graph having it...
RSS
2007
14 years 11 months ago
2007
— We present an efficient algorithm to compute the generalized penetration depth (PDg) between rigid models. Given two overlapping objects, our algorithm attempts to compute the...
SMA
2006
ACM
15 years 3 months ago
2006
ACM
— We present an efficient algorithm to compute the generalized penetration depth (PDg) between rigid models. Given two overlapping objects, our algorithm attempts to compute the...
ASPDAC
1999
ACM
15 years 1 months ago
1999
ACM
We present an algorithm for solving a general min-cut, twoway partitioning problem subject to timing constraints. The problem is formulated as a constrained programming problem an...