DOIAbstract
AbstractThis paper considers the multicommodity flow problem and the integer multicommodity flow problem on cycle graphs. We present two linear time algorithms for solving each of the two problems
AbstractThis paper considers the multicommodity flow problem and the integer multicommodity flow problem on cycle graphs. We present two linear time algorithms for solving each of the two problems
This paper considers the integral multicommodity flow problem on directed graphs underlying two clas...
AbstractSuppose that G is a graph, and (si,ti) (1≤i≤k) are pairs of vertices; and that each edge has...
This paper considers the problem of designing fast, approximate, combinatorial algorithms for multic...
AbstractThis paper considers the multicommodity flow problem and the integer multicommodity flow pro...
AbstractThe integer multicommodity flow problem on a cycle (IMFC) is to find a feasible integral rou...
The multicommodity flow problem (MCF) and the length-bounded flow problem (LBF) are two generalisati...
In this paper, we introduce a new framework for approx-imately solving flow problems in capacitated,...
Flows over time problems consider finding optimal dynamic flows over a network where capacities and ...
AbstractAll previously known algorithms for solving the multicommodity flow problem with capacities ...
We present a fully polynomial-time approximation scheme for a multicommodity flow problem that yiel...
AbstractFor a class CB (capacity balanced networks) of directed planar networks, we give an O(K|V|) ...
Traditionally, flows over time are solved in time expanded networks which contain one copy of the or...
Flow variation over time is an important feature in network flow problems arising in various applica...
This paper considers the problem of designing fast, approximate, combinatorial algorithms for multic...
Original manuscript May 8, 2012The maximum multicommodity flow problem is a natural generalization o...
This paper considers the integral multicommodity flow problem on directed graphs underlying two clas...
AbstractSuppose that G is a graph, and (si,ti) (1≤i≤k) are pairs of vertices; and that each edge has...
This paper considers the problem of designing fast, approximate, combinatorial algorithms for multic...
AbstractThis paper considers the multicommodity flow problem and the integer multicommodity flow pro...
AbstractThe integer multicommodity flow problem on a cycle (IMFC) is to find a feasible integral rou...
The multicommodity flow problem (MCF) and the length-bounded flow problem (LBF) are two generalisati...
In this paper, we introduce a new framework for approx-imately solving flow problems in capacitated,...
Flows over time problems consider finding optimal dynamic flows over a network where capacities and ...
AbstractAll previously known algorithms for solving the multicommodity flow problem with capacities ...
We present a fully polynomial-time approximation scheme for a multicommodity flow problem that yiel...
AbstractFor a class CB (capacity balanced networks) of directed planar networks, we give an O(K|V|) ...
Traditionally, flows over time are solved in time expanded networks which contain one copy of the or...
Flow variation over time is an important feature in network flow problems arising in various applica...
This paper considers the problem of designing fast, approximate, combinatorial algorithms for multic...
Original manuscript May 8, 2012The maximum multicommodity flow problem is a natural generalization o...
This paper considers the integral multicommodity flow problem on directed graphs underlying two clas...
AbstractSuppose that G is a graph, and (si,ti) (1≤i≤k) are pairs of vertices; and that each edge has...
This paper considers the problem of designing fast, approximate, combinatorial algorithms for multic...
Add to ORKG