Related papers: Cost-volume relationships for flows through a diso…
Consider a simple finite graph and its nodes to represent identical water barrels (containing different amounts of water) on a level plane. Each edge corresponds to a (locked, water-filled) pipe connecting two barrels below the plane. We…
Two finite volume methods are derived and applied to the solution of problems of incompressible flow. In particular, external inviscid flows and boundary-layer flows are examined. The firstmethod analyzed is a cell-centered finite volume…
We investigate the effect of a specific edge weighting scheme $\sim (k_i k_j)^{\beta}$ on distributed flow efficiency and robustness to cascading failures in scale-free networks. In particular, we analyze a simple, yet fundamental…
Fluid transport networks are important in many natural settings and engineering applications, from animal cardiovascular and respiratory systems to plant vasculature to plumbing networks and chemical plants. Understanding how network…
We investigate the complexity and approximability of the budget-constrained minimum cost flow problem, which is an extension of the traditional minimum cost flow problem by a second kind of costs associated with each edge, whose total value…
We extend the theory of gradient flows beyond metric spaces by studying evolution variational inequalities (EVIs) driven by general cost functions $c$, including Bregman and entropic transport divergences. We establish several properties of…
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…
Traffic flows in a distributed computing network require both transmission and processing, and can be interdicted by removing either communication or computation resources. We study the robustness of a distributed computing network under…
The cost volume, capturing the similarity of possible correspondences across two input images, is a key ingredient in state-of-the-art optical flow approaches. When sampling correspondences to build the cost volume, a large neighborhood…
The problem of sending the maximum amount of flow $q$ between two arbitrary nodes $s$ and $t$ of complex networks along links with unit capacity is studied, which is equivalent to determining the number of link-disjoint paths between $s$…
We show that a steady-state stock-flow consistent macro-economic model can be represented as a Constraint Satisfaction Problem (CSP).The set of solutions is a polytope, which volume depends on the constraintsapplied and reveals the…
We develop an algorithm that computes for a given undirected or directed network with flow-dependent piece-wise linear edge cost functions all Wardrop equilibria as a function of the flow demand. Our algorithm is based on Katzenelson's…
The maximum achievable capacity from source to destination in a network is limited by the min-cut max-flow bound; this serves as a converse limit. In practice, link capacities often fluctuate due to dynamic network conditions. In this work,…
We consider network models where information items flow %are sent from a source to a sink node. We start with a model where routing is constrained by energy available on nodes in finite supply (like in Smartdust) and efficiency is related…
In contrast to traditional flow networks, in additive flow networks, to every edge e is assigned a gain factor g(e) which represents the loss or gain of the flow while using edge e. Hence, if a flow f(e) enters the edge e and f(e) is less…
The capacity (or maximum flow) of an unicast network is known to be equal to the minimum s-t cut capacity due to the max-flow min-cut theorem. If the topology of a network (or link capacities) is dynamically changing or unknown, it is not…
Spatial networks are networks where nodes are located in a space equipped with a metric. Typically, the space is two-dimensional and until recently and traditionally, the metric that was usually considered was the Euclidean distance. In…
The minimum cost flow problem is one of the most studied network optimization problems and appears in numerous applications. Some efficient algorithms exist for this problem, which are freely available in the form of libraries or software…
We consider general, steady, balanced flows of a commodity over a network where an instance of the network flow is characterized by edge flows and nodal potentials. Edge flows in and out of a node are assumed to be conserved, thus…
We consider a general stable flow problem in a directed and capacitated network, where each vertex has a strict preference list over the incoming and outgoing edges. A flow is stable if no group of vertices forming a path can mutually…