113
Voted
NETWORKS
2010
14 years 9 months ago
2010
101
Voted
NETWORKS
2010
14 years 9 months ago
2010
137
Voted
NETWORKS
2010
15 years 28 days 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...
107
Voted
NETWORKS
2010
15 years 28 days 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...
112
Voted
NETWORKS
2010
15 years 28 days 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...
136
Voted
NETWORKS
2010
15 years 28 days 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...
120
click to vote
NETWORKS
2010
15 years 28 days 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...
218
Voted
NETWORKS
2010
15 years 28 days ago
2010