55 search results - page 1 / 11 » Construction of vertex-disjoint paths in alternating group n... |
TJS
2010
13 years 3 months ago
2010
FSTTCS
2009
Springer
13 years 11 months ago
2009
Springer
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...
FOCS
2007
IEEE
13 years 11 months ago
2007
IEEE
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...
GLOBECOM
2006
IEEE
13 years 11 months ago
2006
IEEE
— 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 ...
ICITA
2005
IEEE
13 years 10 months ago
2005
IEEE
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...