Related papers: A tight bound on the speed-up through storage for …
In this paper, we bound the integrality gap and the approximation ratio for maximum plane multiflow problems and deduce bounds on the flow-cut-gap. Planarity means here that the union of the supply and demand graph is planar. We first prove…
The single-source unsplittable flow (SSUF) problem asks to send flow from a common source to different terminals with unrelated demands, each terminal being served through a single path. One of the most heavily studied SSUF objectives is to…
We consider a model for mixing binary viscous fluids under an incompressible flow. We proof the impossibility of perfect mixing in finite time for flows with finite viscous dissipation. As measures of mixedness we consider a…
We consider the efficiency of turbulence, a dimensionless parameter that characterises the fraction of the input energy stored into a turbulent flow field. We first show that the inverse of the efficiency provides an upper bound for the…
This paper is concerned with the analysis of speed-up of reaction-diffusion-advection traveling fronts in infinite cylinders with periodic boundary conditions. The advection is a shear flow with a large amplitude and the reaction is…
We study the dissipation enhancement by cellular flows. Previous work by Iyer, Xu, and Zlato\v{s} produces a family of cellular flows that can enhance dissipation by an arbitrarily large amount. We improve this result by providing…
The multicommodity flow problem is a classic problem in network flow and combinatorial optimization, with applications in transportation, communication, logistics, and supply chain management, etc. Existing algorithms often focus on…
We consider the problem to transport resources/mass while abiding by constraints on the flow through constrictions along their path between specified terminal distributions. Constrictions, conceptualized as toll stations at specified…
Flow scheduling is crucial in data centers, as it directly influences user experience of applications. According to different assumptions and design goals, there are four typical flow scheduling problems/solutions: SRPT, LAS, Fair Queueing,…
Zermelo's navigation problem seeks the trajectory of minimal travel time between two points in a fluid flow. We address this problem for an agent -- such as a micro-robot or active particle -- that is advected by a two-dimensional flow,…
While Flow Matching theoretically guarantees constant-velocity trajectories, we identify a critical breakdown in high-dimensional practice: the Velocity Deficit. We show that the MSE objective systematically underestimates velocity…
We consider the standard first passage percolation model on Z^d with a distribution G on R+ that admits an exponential moment. We study the maximal flow between a compact convex subset A of R^d and infinity. The study of maximal flow is…
With growing emphasis on e-commerce marketplace platforms where we have a central platform mediating between the seller and the buyer, it becomes important to keep a check on the availability and profitability of the central store. A store…
Presently flow and nonflow cannot be separated experimentally. Using Pythia simulations of p+p collisions we show that nonflow approximately factorizes. This fact may be used to disentangle flow and nonflow in heavy ion data by performing a…
Co-flows model a modern scheduling setting that is commonly found in a variety of applications in distributed and cloud computing. In co-flow scheduling, there are $m$ input ports and $m$ output ports. Each co-flow $j \in J$ can be…
We consider the standard first passage percolation model in $\mathbb{Z}^d$ for $d\geq 2$. We are interested in two quantities, the maximal flow $\tau$ between the lower half and the upper half of the box, and the maximal flow $\phi$ between…
We consider the problem of designing a packet-level congestion control and scheduling policy for datacenter networks. Current datacenter networks primarily inherit the principles that went into the design of Internet, where congestion…
We consider the problem of multicommodity flows in planar graphs. Seymour showed that if the union of supply and demand graphs is planar, then the cut condition is sufficient for routing demands. Okamura-Seymour showed that if all demands…
We consider a coupled reaction-advection-diffusion system based on the Fisher-KPP and Burgers equations. These equations serve as a one-dimensional version of a model for a reacting fluid in which the arising density differences induce a…
The type $A$ Kostant partition function is an important combinatorial object with various applications: it counts integer flows on the complete directed graph, computes Hilbert series of spaces of diagonal harmonics, and can be used to…