108 search results - page 5 / 22 » Probabilistic models for the Steiner Tree problem |
ASPDAC
2006
ACM
14 years 1 months ago
2006
ACM
Abstract— Routing tree construction is a fundamental problem in modern VLSI design. In this paper we propose CDCTree, an Obstacle-Avoiding Rectilinear Steiner Minimum Tree (OARSM...
SODA
2010
ACM
14 years 5 months ago
2010
ACM
We consider robust network design problems where the set of feasible demands may be given by an arbitrary polytope or convex body more generally. This model, introduced by BenAmeu...
JDCTA
2010
13 years 2 months ago
2010
In order to solve the low efficiency problem of directly querying single node probability in the set of all ordinary XML data obtained by enumerating possible world set of the cor...
ICALP
2005
Springer
14 years 1 months ago
2005
Springer
We define an algorithmic paradigm, the stack model, that captures many primal-dual and local-ratio algorithms for approximating covering and packing problems. The stack model is ...
PODS
2007
ACM
14 years 7 months ago
2007
ACM
In [3], we introduced a framework for querying and updating probabilistic information over unordered labeled trees, the probabilistic tree model. The data model is based on trees ...