701 search results - page 13 / 141 » An Ant Algorithm for the Steiner Tree Problem in Graphs |
CEC
2008
IEEE
14 years 1 months ago
2008
IEEE
NETWORKS
1998
13 years 7 months ago
1998
SODA
2010
ACM
14 years 4 months ago
2010
ACM
The group Steiner problem is a classical network design problem where we are given a graph and a collection of groups of vertices, and want to build a min-cost subgraph that conne...
NETWORKS
2010
13 years 5 months ago
2010
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...
ICALP
2005
Springer
14 years 26 days ago
2005
Springer
In the Euclidean group Traveling Salesman Problem (TSP), we are given a set of points P in the plane and a set of m connected regions, each containing at least one point of P. We w...