Sciweavers

298 search results - page 3 / 60
» Multicriteria Steiner Tree Problem for Communication Network
Sort
View
INFOCOM
1996
IEEE
13 years 10 months ago
ARIES: A Rearrangeable Inexpensive Edge-Based On-Line Steiner Algorithm
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...
Fred Bauer, Anujan Varma
INFOCOM
2009
IEEE
14 years 14 days ago
Hardness and Approximation of the Survivable Multi-Level Fat Tree Problem
—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...
Hung Q. Ngo, Thanh-Nhan Nguyen, Dahai Xu
ENDM
2010
101views more  ENDM 2010»
13 years 5 months ago
Strong Lower Bounds for a Survivable Network Design Problem
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...
Markus Leitner, Günther R. Raidl
ICDE
2009
IEEE
139views Database» more  ICDE 2009»
14 years 7 months ago
Minimizing Communication Cost in Distributed Multi-query Processing
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...
Jian Li, Amol Deshpande, Samir Khuller
SIAMCOMP
2008
104views more  SIAMCOMP 2008»
13 years 5 months ago
A Group-Strategyproof Cost Sharing Mechanism for the Steiner Forest Game
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...
Jochen Könemann, Stefano Leonardi, Guido Sch&...