Sciweavers

55 search results - page 1 / 11
» Construction of vertex-disjoint paths in alternating group n...
Sort
View
TJS
2010
80views more  TJS 2010»
13 years 2 months ago
Construction of vertex-disjoint paths in alternating group networks
Shuming Zhou, Wenjun Xiao, Behrooz Parhami
FSTTCS
2009
Springer
13 years 10 months ago
Approximating Fault-Tolerant Group-Steiner Problems
In this paper, we initiate the study of designing approximation algorithms for FaultTolerant Group-Steiner (FTGS) problems. The motivation is to protect the well-studied group-Ste...
Rohit Khandekar, Guy Kortsarz, Zeev Nutov
FOCS
2007
IEEE
13 years 10 months ago
Finding Disjoint Paths in Expanders Deterministically and Online
We describe a deterministic, polynomial time algorithm for finding edge-disjoint paths connecting given pairs of vertices in an expander. Specifically, the input of the algorith...
Noga Alon, Michael R. Capalbo
GLOBECOM
2006
IEEE
13 years 10 months ago
Optimal Routing Between Alternate Paths With Different Network Transit Delays
— We consider the path-determination problem in Internet core routers that distribute flows across alternate paths leading to the same destination. We assume that the remainder ...
Essia Hamouda Elhafsi, Mart Molle
ICITA
2005
IEEE
13 years 10 months ago
A Structured Peer-to-Peer Method to Discover QoS Enhanced Alternate Paths
In the next generation Internet, the network should not only be considered as a communication medium, but also as an endless source of services available to the end-systems. These...
Thierry Rakotoarivelo, Patrick Sénac, Aruna...