1639 search results - page 5 / 328 » Degree-constrained network flows |
NETWORKS
2011
13 years 4 months ago
2011
Abstract. We consider a basic subproblem which arises in line planning, and is of particular importance in the context of a high system load or robustness: How much can be routed m...
PAM
2011
Springer
13 years 19 days ago
2011
Springer
More than 20 years after the launch of the public Internet, operator forums are still full of reports about temporary unreachability of complete networks. We propose FACT, a system...
TOC
2008
13 years 9 months ago
2008
For an integer h 1, an elementary h-route flow is a flow along h edge disjoint paths between a source and a sink, each path carrying a unit of flow, and a single commodity h-rout...
ANOR
2010
13 years 7 months ago
2010
Abstract. Suppose given a network endowed with a multiflow. We want to estimate some quantities connected with this multiflow, for instance the value of an s
PIMRC
2010
IEEE
13 years 7 months ago
2010
IEEE
In this paper we show how game theory and Gibbs sampling techniques can be used to design a self-optimizing algorithm for minimizing end-to-end delays for all flows in a multi-clas...