290 search results - page 7 / 58 » Balancing Applied to Maximum Network Flow Problems |
STOC
2004
ACM
14 years 7 months ago
2004
ACM
A flow is said to be confluent if at any node all the flow leaves along a single edge. Given a directed graph G with k sinks and non-negative demands on all the nodes of G, we con...
JAL
2006
13 years 7 months ago
2006
In this paper we consider the unsplittable flow problem (UFP): given a directed or undirected network G = (V, E) with edge capacities and a set of terminal pairs (or requests) wit...
MOR
2000
13 years 7 months ago
2000
Given a network and a set of connection requests on it, we consider the maximum edge-disjoint paths and related generalizations and routing problems that arise in assigning paths f...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
In this work, we derive an algebraic formulation for the scalar linear network coding problem as an alternative to the one presented by Koetter et al in [1]. Using an equivalence b...
ISCC
2006
IEEE
14 years 1 months ago
2006
IEEE
In this paper we focus on issues of restorable dynamic routing in MPLS networks. We assume that the considered MPLS network must provide reliable service including restorable rout...