701 search results - page 13 / 141 » An Ant Algorithm for the Steiner Tree Problem in Graphs |
87
Voted
CEC
2008
IEEE
15 years 9 months ago
2008
IEEE
87
Voted
NETWORKS
1998
15 years 2 months ago
1998
120
click to vote
SODA
2010
ACM
16 years 20 days 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...
140
click to vote
NETWORKS
2010
15 years 1 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...
127
click to vote
ICALP
2005
Springer
15 years 8 months 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...