336 search results - page 22 / 68 » Analytic Cut Trees |
CORR
2010
Springer
13 years 5 months ago
2010
Springer
We present a general method of designing fast approximation algorithms for cut-based minimization problems in undirected graphs. In particular, we develop a technique that given a...
CAD
2008
Springer
13 years 7 months ago
2008
Springer
This paper presents a new method for evaluating boolean set operations between Binary Space Partition (BSP) trees. Our algorithm has many desirable features including both numeric...
SIAMREV
2011
12 years 10 months ago
2011
We propose a mathematical model for an infestation of a wooded area by a beetle species in which the larvae develop deep in the wood of living trees. Due to the difficulties of det...
TRANSCI
2008
13 years 7 months ago
2008
The traffic assignment problem with elastic demands can be formulated as an optimization problem, whose objective is sum of a congestion function and a disutility function. We pro...
SIAMDM
2008
13 years 7 months ago
2008
We study the variety of subtrees lying on the fringe of recursive trees and binary search trees by analyzing the distributional behavior of Xn,k, which counts the number of subtree...