NETWORKS
2010
13 years 6 months ago
2010
NETWORKS
2010
13 years 6 months ago
2010
NETWORKS
2010
13 years 6 months ago
2010
NETWORKS
2010
13 years 10 months ago
2010
Abstract. In this paper, motivated by applications of ordinary (distance) spanners in communication networks and to address such issues as bandwidth constraints on network links, l...
NETWORKS
2010
13 years 10 months ago
2010
The input to an Inverse Shortest Path Lengths Problem (ISPL) consists of a graph G with arc weights, and a collection of source-sink pairs with prescribed distances that do not ne...
NETWORKS
2010
13 years 10 months ago
2010
This paper considers a minimum cost flow problem where arc costs are uncertain, and the decision maker wishes to minimize both the expected flow cost and the variance of this co...
NETWORKS
2010
13 years 10 months ago
2010
We consider a probabilistic model for the Steiner Tree problem. Under this model the problem is defined in a 2-stage setting over a first-stage complete weighted graph having it...
NETWORKS
2010
13 years 10 months ago
2010
NETWORKS
2010
13 years 10 months ago
2010
Maˇnuch and Stacho [7] introduced the problem of designing f-tolerant routings in optical networks, i.e., routings which still satisfy the given requests even if f failures occur...
NETWORKS
2010
13 years 10 months ago
2010