701 search results - page 9 / 141 » An Ant Algorithm for the Steiner Tree Problem in Graphs |
124
click to vote
IPCO
2001
15 years 4 months ago
2001
Garg [10] gives two approximation algorithms for the minimum-cost tree spanning k vertices in an undirected graph. Recently Jain and Vazirani [16] discovered primal-dual approxima...
137
click to vote
DAM
1999
15 years 2 months ago
1999
This paper deals with the problem of constructing Steiner trees of minimum weight with diameter bounded by d, spanning a given set of vertices in a graph. Exact solutions or logar...
150
click to vote
ICCAD
1999
IEEE
15 years 7 months ago
1999
IEEE
The minimum rectilinear Steiner tree (RST) problem is one of the fundamental problems in the field of electronic design automation. The problem is NP-hard, and much work has been ...
109
click to vote
APPROX
2007
Springer
15 years 7 months ago
2007
Springer
We study the Steiner Tree problem in the model of two-stage stochastic optimization with non-uniform inflation factors, and give a poly-logarithmic approximation factor for this pr...
154
click to vote
SODA
1992
ACM
15 years 4 months ago
1992
ACM
We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph wit...