Related papers: Cost-Flow Summation Algorithm Based on Table Form …
Motivated by the challenge of analyzing data sets with periodic boundary conditions to investigate transportation properties, we introduce a concept of circular max-flow for graphs mapped onto the circle. Unlike classical max-flow…
We present an $m^{4/3+o(1)}\log W$-time algorithm for solving the minimum cost flow problem in graphs with unit capacity, where $W$ is the maximum absolute value of any edge weight. For sparse graphs, this improves over the best known…
We consider the CONGEST model on a network with $n$ nodes, $m$ edges, diameter $D$, and integer costs and capacities bounded by $\text{poly} n$. In this paper, we show how to find an exact solution to the minimum cost flow problem in…
For general connections, the problem of finding network codes and optimizing resources for those codes is intrinsically difficult and little is known about its complexity. Most of the existing solutions rely on very restricted classes of…
Consider a transportation problem with sets of sources and sinks. There are profits and prices on the edges. The goal is to maximize the profit while meeting the following constraints; the total flow going out of a source must not exceed…
Our goal is to find combinations of facts that optimally summarize data sets. We consider this problem in the context of voice query interfaces for simple, exploratory data analysis. Here, the system answers voice queries with a short…
I introduce a new approach to the maximum flow problem by a simple algorithm with a slightly better runtime. This approach is based on sorting arcs insight of vertices on a residual graph. This new approach leads to an O(mn^0.5) time bound…
A thesis submitted for the degree of Doctor of Philosophy of The Australian National University. In this work we introduce several new optimisation methods for problems in machine learning. Our algorithms broadly fall into two categories:…
We consider a routing problem which plays an important role in several applications, primarily in communication network planning and VLSI layout design. The original underlying graph algorithmic task is called Disjoint Paths problem. In…
Visually mining a large influence graph is appealing yet challenging. People are amazed by pictures of newscasting graph on Twitter, engaged by hidden citation networks in academics, nevertheless often troubled by the unpleasant readability…
This paper studies the application of the blended dynamics approach towards distributed optimization problem where the global cost function is given by a sum of local cost functions. The benefits include (i) individual cost function need…
Following [21, 23], the present work investigates a new relative entropy-regularized algorithm for solving the optimal transport on a graph problem within the randomized shortest paths formalism. More precisely, a unit flow is injected into…
The problem of Maxflow is a widely developed subject in modern mathematics. Efficient algorithms exist to solve this problem, that is why a good generalization may permit these algorithms to be understood as a particular instance of…
We address an optimization problem where the cost function is the expectation of a random mapping. To tackle the problem two approaches based on the approximation of the objective function by consensus-based particle optimization methods on…
Numerous networks, such as transportation, distribution and delivery networks optimize their designs in order to increase efficiency and lower costs, improving the stability of its intended functions, etc. Networks that distribute goods,…
Graph summarization via node grouping is a popular method to build concise graph representations by grouping nodes from the original graph into supernodes and encoding edges into superedges such that the loss of adjacency information is…
Clustering points in a vector space or nodes in a graph is a ubiquitous primitive in statistical data analysis, and it is commonly used for exploratory data analysis. In practice, it is often of interest to "refine" or "improve" a given…
We introduce a new approach to computing an approximately maximum s-t flow in a capacitated, undirected graph. This flow is computed by solving a sequence of electrical flow problems. Each electrical flow is given by the solution of a…
In the present paper, we apply the network simplex algorithm for solving the minimum cost flow problem, to the maximum flow problem. Then we prove that the cycling phenomenon which causes the infinite loop in the algorithm, does not occur…
Power flow calculation in EMS is required to accommodate a large and complex power system. To achieve a faster than real-time calculation, a graph based power flow calculation is proposed in this paper. Graph database and graph computing…