Related papers: On stable flows and preflows
This paper addresses the scheduling problem of coflows in identical parallel networks, which is a well-known $NP$-hard problem. Coflow is a relatively new network abstraction used to characterize communication patterns in data centers. We…
Gradient-based first-order convex optimization algorithms find widespread applicability in a variety of domains, including machine learning tasks. Motivated by the recent advances in fixed-time stability theory of continuous-time dynamical…
Modern data centers face new scheduling challenges in optimizing job-level performance objectives, where a significant challenge is the scheduling of highly parallel data flows with a common performance goal (e.g., the shuffle operations in…
We give the first O(m polylog(n)) time algorithms for approximating maximum flows in undirected graphs and constructing polylog(n) -quality cut-approximating hierarchical tree decompositions. Our algorithm invokes existing algorithms for…
We construct a family of steady solutions to the two-dimensional incompressible Euler equation in a general bounded domain, such that the vorticity is supported in two well-separated regions of small diameter and converges to a pair of…
Precession driven flows are found in any rotating container filled with liquid, when the rotation axis itself rotates about a secondary axis that is fixed in an inertial frame of reference. Because of its relevance for planetary fluid…
In their seminal work on the Stable Marriage Problem, Gale and Shapley describe an algorithm which finds a stable matching in $O(n^2)$ communication rounds. Their algorithm has a natural interpretation as a distributed algorithm where each…
We present a polynomial time approximation algorithm for constructing an overlay multicast network for streaming live media events over the Internet. The class of overlay networks constructed by our algorithm include networks used by Akamai…
Stability of inviscid shear shallow water flows with free surface is studied in the framework of the Benney equations. This is done by investigating the generalized hyperbolicity of the integrodifferential Benney system of equations. It is…
The unreal high flows may appear on the actually congested links in the result when a monotonically increasing link travel time function of flow volume is adopted in traffic assignment. The fixed link flow results of a static traffic…
In this article, we address the solution of advection-dominated flow problems by stabilised methods, by means of least-squares computed stabilised coefficients. As main methodological tool, we introduce a data-driven off-line/on-line…
We present an alternative and simpler method for computing principal typings of flow networks. When limited to planar flow networks, the method can be made to run in fixed-parameter linear-time -- where the parameter not to be exceeded is…
We consider the stable assignment problem on a graph with nonnegative real capacities on the edges and quotas on the vertices, in which the preferences of agents are given via diversifying choice functions. We prove that for any input of…
The computation of electrical flows is a crucial primitive for many recently proposed optimization algorithms on weighted networks. While typically implemented as a centralized subroutine, the ability to perform this task in a fully…
We show a deterministic constant-time local algorithm for constructing an approximately maximum flow and minimum fractional cut in multisource-multitarget networks with bounded degrees and bounded edge capacities. Locality means that the…
When a fluid comprised of multiple phases or constituents flows through a network, non-linear phenomena such as multiple stable equilibrium states and spontaneous oscillations can occur. Such behavior has been observed or predicted in a…
We introduce a notion of stability for non-autonomous Hamiltonian flows on two-dimensional annular surfaces. This notion of stability is designed to capture the sustained twisting of particle trajectories. The main Theorem is applied to…
This paper is concerned with a fluidodynamic model for traffic flow. More precisely, we consider a single conservation law, deduced from conservation of the number of cars, defined on a road network that is a collection of roads with…
In this paper, we present an improved algorithm for the maximum flow problem on general networks with $n$ vertices and $m$ arcs. We show how to solve the problem in $O(mn)$ time, when $m = O(n^{2-\epsilon})$, for some $0 <\epsilon \leq 1$.…
The paper investigates the problem of finding communities in complex network systems, the detection of which allows a better understanding of the laws of their functioning. To solve this problem, two approaches are proposed based on the use…