701 search results - page 20 / 141 » An Ant Algorithm for the Steiner Tree Problem in Graphs |
135
click to vote
ENDM
2010
15 years 3 months ago
2010
We consider a generalization of the Prize Collecting Steiner Tree Problem on a graph with special redundancy requirements on a subset of the customer nodes suitable to model a rea...
113
click to vote
SIAMDM
2010
15 years 1 months ago
2010
We consider the class of max-min and min-max optimization problems subject to a global budget (or weight) constraint and we undertake a systematic algorithmic and complexitytheore...
165
click to vote
COMPGEOM
1992
ACM
15 years 7 months ago
1992
ACM
Suppose we are given a sequence of n points in the Euclidean plane, and our objective is to construct, on-line, a connected graph that connects all of them, trying to minimize the...
118
click to vote
SIAMCOMP
2010
14 years 10 months ago
2010
The (undirected) Steiner Network problem is: given a graph = ( , ) with edge/node-weights and edge-connectivity requirements { ( , ) : , }, find a minimumweight subgraph of conta...
131
Voted
INFOCOM
1996
IEEE
15 years 7 months ago
1996
IEEE
In this paper, we propose and evaluate ARIES, a heuristic for updating multicast trees dynamically in large point-to-point networks. The algorithm is based on monitoring the accum...