background and objective: cerebral arteriovenous malformation (cavm) hemodynamic is disease condition, results changes in the flow and pressure level in cerebral blood vessels. measuring flow and pressure without catheter intervention along the vessel is big challenge due to vessel bifurcations/complex bifurcations in arteriovenous malformation patients. the vessel geometry in cavm patients are...

We consider the minimum cost flow problem on graphs with unit capacities and its special cases. In previous studies, special purpose algorithms exploiting the fact that capacities are one have been developed. In contrast, for maximum flow with unit capacities, the best bounds are proven for slight modifications of classical blocking flow and push-relabel algorithms. In this paper we show that t...

We study the task of computing a matching between two images by formulating it as an instance of the minimum-cost flow problem. Here, we use a cycle cancelling algorithm to find the optimal flow. To reduce the practical runtime, we propose a hierarchical scheme in which the images are first scaled down and then the optimal solution for the smaller problem is used as a starting point for the hig...

We consider a compound problem of the generalized minimum-cost flow problem and the independent-flow problem, which we call the generalized independent-flow problem. The generalized minimumcost flow problem is to find a minimum-cost flow in a capacitated network with gains, where each arc flow is multiplied by a gain factor when going through an arc. On the other hand, the independent-flow prob...

This article addresses path selection problems that arise in a large-scale media server. In particular, the problem on a distributed server with two tiers of server nodes connected by a VC-enabled interconnection network is considered. To serve each incoming request, a pair of server nodes should be selected to handle the request. In addition, a network path in the interconnection network shoul...

One of the main goals in transportation planning is to achieve solutions for two classical problems, the traffic assignment and toll pricing problems. The traffic assignment problem aims to minimize total travel delay among all travelers. Based on data derived from the first problem, the toll pricing problem determines the set of tolls and corresponding tariffs that would collectively benefit a...