Sciweavers

982 search results - page 13 / 197
» Solving Steiner tree problems in graphs to optimality
Sort
View
TVLSI
2002
82views more  TVLSI 2002»
14 years 9 months ago
Probability-based approach to rectilinear Steiner tree problems
Abstract--The rectilinear Steiner tree (RST) problem is of essential importance to the automatic interconnect optimization for VLSI design. In this paper, we present a class of pro...
Chunhong Chen, Jiang Zhao, Majid Ahmadi
TCAD
2002
128views more  TCAD 2002»
14 years 9 months ago
Preferred direction Steiner trees
Interconnect optimization for VLSI circuits has received wide attention. To model routing surfaces, multiple circuit layers are freabstracted as a single rectilinear plane, ignori...
Mehmet Can Yildiz, Patrick H. Madden
COCOA
2008
Springer
14 years 11 months ago
Elementary Approximation Algorithms for Prize Collecting Steiner Tree Problems
This paper deals with approximation algorithms for the prize collecting generalized Steiner forest problem, defined as follows. The input is an undirected graph G = (V, E), a colle...
Shai Gutner
ICDE
2009
IEEE
139views Database» more  ICDE 2009»
15 years 11 months ago
Minimizing Communication Cost in Distributed Multi-query Processing
Increasing prevalence of large-scale distributed monitoring and computing environments such as sensor networks, scientific federations, Grids etc., has led to a renewed interest in...
Jian Li, Amol Deshpande, Samir Khuller
ESA
2007
Springer
118views Algorithms» more  ESA 2007»
15 years 4 months ago
A New ILP Formulation for 2-Root-Connected Prize-Collecting Steiner Networks
We consider the real-world problem of extending a given infrastructure network in order to connect new customers. By representing the infrastructure by a single root node, this pro...
Markus Chimani, Maria Kandyba, Petra Mutzel