Sciweavers

108 search results - page 1 / 22
» Probabilistic models for the Steiner Tree problem
Sort
View
NETWORKS
2010
13 years 3 months ago
Probabilistic models for the Steiner Tree problem
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...
Vangelis Th. Paschos, Orestis Telelis, Vassilis Zi...
ISAAC
2010
Springer
253views Algorithms» more  ISAAC 2010»
13 years 2 months ago
Solving Two-Stage Stochastic Steiner Tree Problems by Two-Stage Branch-and-Cut
Abstract. We consider the Steiner tree problem under a 2-stage stochastic model with recourse and finitely many scenarios (SSTP). Thereby, edges are purchased in the first stage wh...
Immanuel M. Bomze, Markus Chimani, Michael Jü...
VLSID
2002
IEEE
109views VLSI» more  VLSID 2002»
14 years 5 months ago
Probabilistic Analysis of Rectilinear Steiner Trees
Steiner tree is a fundamental problem in the automatic interconnect optimization for VLSI design. We present a probabilistic analysis method for constructing rectilinear Steiner t...
Chunhong Chen
CORR
2011
Springer
159views Education» more  CORR 2011»
12 years 12 months ago
Multicriteria Steiner Tree Problem for Communication Network
Abstract—This paper addresses combinatorial optimization schemes for solving the multicriteria Steiner tree problem for communication network topology design (e.g., wireless mesh...
Mark Sh. Levin, Rustem I. Nuriakhmetov
DAC
2006
ACM
14 years 5 months ago
Circuit simulation based obstacle-aware Steiner routing
Steiner routing is a fundamental yet NP-hard problem in VLSI design and other research fields. In this paper, we propose to model the routing graph by an RC network with routing t...
Yiyu Shi, Paul Mesa, Hao Yu, Lei He