9 search results - page 1 / 2 » Finding Minimum-Cost Paths with Minimum Sharability |
INFOCOM
2007
IEEE
14 years 5 months ago
2007
IEEE
Abstract— In communication networks, multiple communication paths sharing minimum number of links or/and nodes may be desirable for improved performance, resource utilization and...
TON
2010
13 years 5 months ago
2010
Abstract--In communication networks, multiple disjoint communication paths are desirable for many applications. Such paths, however, may not exist in a network. In such a situation...
EUC
2005
Springer
14 years 4 months ago
2005
Springer
Abstract. We have presented an optimal algorithm for minimal cost loop problem (MCLP), which consists of finding a set of minimum cost loops rooted at a source node. In the MCLP, t...
ESA
2006
Springer
14 years 2 months ago
2006
Springer
An instance of the path hitting problem consists of two families of paths, D and H, in a common undirected graph, where each path in H is associated with a non-negative cost. We r...
JCO
2006
13 years 11 months ago
2006
Abstract. We study efficient algorithms for establishing reliable connections with bandwidth guarantees in communication networks. In the normal mode of operation, each connection ...