In this paper, we study the minimum-cost quality-ofservice multicast and unicast routing problems in communication networks. For the multicast problem, we present an efficient approximation algorithm to find a balance between a minimum-cost multicast tree and a minimum-delay multicast tree, with a provably good performance under the condition that link delay and link cost are identical. For the...

Computing the minimum cost path is a key requirement in Intelligent Transportation Systems (ITS) and in some Geographical Information Systems (GIS) applications. The major characteristics of these systems are the facts that the underlying transportation graph is large in size and the computation is under time constraint. Due to the insufficiency of the classic algorithms under these settings, r...

The multiobjective shortest path problem (MSPP) consists of finding the best nondominated path linking two specified nodes in a network where k > 1 different criteria are considered for the arc costs. Solving the MSPP implies determining all the nondominated paths; there may be many such paths, making the selection process a very hard task to accomplish. A traditional way of dealing with such a...

In this paper we show that minimum-cost spanning tree is a special case of the closed semiring path-nding problem. This observation gives us a non-recursive algorithm for nding minimum-cost spanning trees on mesh-connected computers that has the same asymptotic running time but is much simpler than the previous recursive algorithms.

Applying a minimum-cost path algorithm to find the path through the bottom of a curvilinear valley yields a biased path through the inside of a corner. DNA molecules, blood vessels, and neurite tracks are examples of string-like (network) structures, whose minimum-cost path is cutting through corners and is less flexible than the underlying centerline. Hence, the path is too short and its shape...

The reload cost concept refers to the cost that occurs at a vertex along a path on an edge-colored graph when it traverses an internal vertex between two edges of different colors. The reload cost depends only on the colors of the traversed edges. Previous work on reload costs focuses on the problem of finding a spanning tree that minimizes the total reload cost from a source vertex to all othe...

Diffusion MRI can be used to study the structural connectivity within the brain. Brain connectivity is often represented by a binary network whose topology can be studied using graph theory. We present a framework for the construction of weighted structural brain networks, containing information about connectivity, which can be effectively analyzed using statistical methods. Network nodes are d...

We consider the problem of nding a minimum cost acceptable path on a toroidal grid graph, where each horizontal and each vertical edge have the same orientation. An acceptable path is closed path that makes a complete horizontal and vertical circuit. We exploit the structure of this graph to develop eecient parallel algorithms for a message passing computer. Given p processors and an m by n tor...

We introduce a practically important and theoretically challenging problem: finding the minimum cost path for plug-in hybrid electric vehicles (PHEVs) in a network with refueling and battery switching stations, considering electricity and gasoline as sources of energy with different cost structures and limitations. We show that this problem is NP-complete even though its electric vehicle and co...

An inverse optimization problems is defined as follows: Let S denote the set of feasible solutions of an optimization problem P, let c be a specified cost vector, and xO be a given feasible solution. We want to perturb the cost vector c to d so that x is an optimal solution of P with respect to the cost vector d , and lid clip is minimum, where 11.llp denotes some selected Lp norm. In this pape...