298 search results - page 3 / 60 » Multicriteria Steiner Tree Problem for Communication Network |
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...
128
Voted
INFOCOM
2009
IEEE
15 years 10 months ago
2009
IEEE
—With the explosive deployment of “triple play” (voice, video and data services) over the same access network, guaranteeing a certain-level of survivability for the access ne...
136
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...
265
click to vote
ICDE
2009
IEEE
16 years 5 months ago
2009
IEEE
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...
122
click to vote
SIAMCOMP
2008
15 years 3 months ago
2008
We consider a game-theoretical variant of the Steiner forest problem in which each player j, out of a set of k players, strives to connect his terminal pair (sj, tj) of vertices in...