Let G = (V, E) be a network for an assignment problem with 2n nodes and m edges, in which the largest edge cost is C. Recently the class of instances of bipartite matching problems has been shown to be in RNC provided that C is O(logk n) for some fixed k. We show how to use scaling so as to develop an improved parallel algorithm and show that bipartite matching problems are in the class RNC pro...

We investigate the problem of designing a minimum-cost flow network interconnecting n sources and a single sink, each with known locations in a normed space and with associated flow demands. The network may contain any finite number of additional unprescribed nodes from the space; these are known as the Steiner points. For concave increasing cost functions, a minimum cost network of this sort h...

We investigate how to solve several classical network flow problems using secure multi-party computation. We consider the shortest path problem, the minimum mean cycle problem and the minimum cost flow problem. To the best of our knowledge, this is the first time the two last problems have been addressed in a general multi-party computation setting. Furthermore, our study highlights the complex...

I the last two decades, a number of algorithms for the linear single-commodity min-cost flow (MCF) problem have been proposed, and several efficient codes are available that implement different variants of the algorithms. The practical significance of the algorithms has been tested by comparing the time required by their implementations for solving “from-scratch” instances of MCF, of different ...

Earliest arrival flows capture the essence of evacuation planning. Given a network with capacities and transit times on the arcs, a subset of source nodes with supplies and a sink node, the task is to send the given supplies from the sources to the sink “as quickly as possible”. The latter requirement is made more precise by the earliest arrival property which requires that the total amount of ...

Image-based localization is an important problem in robotics and an integral part of visual mapping and navigation systems. An approach to robustly match images to previously recorded ones must be able to cope with seasonal changes especially when it is supposed to work reliably over long periods of time. In this paper, we present a novel approach to visual localization of mobile robots in outd...

This article considers the problems of maximum flow and minimum cost flow determining in fuzzy network. Parameters of fuzzy network are fuzzy arc capacities and transmission costs of one flow unit represented as fuzzy triangular numbers. Conventional rules of operating with fuzzy triangular numbers lead to a strong “blurring” of their borders, resulting in loss of selfdescriptiveness of calcula...

This article considers the problems of maximum flow and minimum cost flow determining in fuzzy network. Parameters of fuzzy network are fuzzy arc capacities and transmission costs of one flow unit represented as fuzzy triangular numbers. Conventional rules of operating with fuzzy triangular numbers lead to a strong “blurring” of their borders, resulting in loss of selfdescriptiveness of calcula...

In this paper we discuss the parallel asynchronous implementation of the classical primaldual method for solving the linear minimum cost network flow problem. Multiple augmentations and price rises are simultaneously attempted starting from several nodes with possibly outdated price and flow information. The results are then merged asynchronously subject to rather weak compatibility conditions....

Recently, much attention has been paid on data-driven (or swarm-like) based live streaming systems due to its rapid growth in deployment over Internet. In such systems, nodes randomly select their neighbors to form an unstructured overlay mesh (gossip-style overlay construction) and then each node requests desired data blocks from its neighbors (block scheduling). To improve the performance, mo...