Related papers: A tight bound on the speed-up through storage for …
An improved fully polynomial-time approximation scheme and a greedy heuristic for the fractional length-bounded maximum multicommodity flow problem with unit edge-lengths are proposed. Computational experiments are carried out on benchmark…
We provide faster strongly polynomial time algorithms solving maximum flow in structured $n$-node $m$-arc networks. Our results imply an $n^{\omega + o(1)}$-time strongly polynomial time algorithms for computing a maximum bipartite…
The relation between the shape of the force driving a turbulent flow and the upper bound on the dimensionless dissipation factor $\beta$ is presented. We are interested in non-trivial (more than two wave numbers) forcing functions in a…
We consider single-sink network flow problems. An instance consists of a capacitated graph (directed or undirected), a sink node $t$ and a set of demands that we want to send to the sink. Here demand $i$ is located at a node $s_i$ and…
We present a new strongly polynomial algorithm for generalized flow maximization that is significantly simpler and faster than the previous strongly polynomial algorithm [V\'egh16]. For the uncapacitated problem formulation, the complexity…
One key requirement for storage clouds is to be able to retrieve data quickly. Recent system measurements have shown that the data retrieving delay in storage clouds is highly variable, which may result in a long latency tail. One crucial…
Conventional quantum speed limits perform poorly for mixed quantum states: They are generally not tight and often significantly underestimate the fastest possible evolution speed. To remedy this, for unitary driving, we derive two quantum…
We examine the fluid flow forced by precession of a rotating cylindrical container using numerical simulations and experimental flow measurements with ultrasonic Doppler velocimetry (UDV). The analysis is based on the decomposition of the…
Recent experiments on mucociliary clearance, an important defense against airborne pathogens, have raised questions about the topology of two-dimensional (2D) flows. We introduce a framework for studying ensembles of 2D time-invariant flow…
We consider algorithms to schedule packets with values and deadlines in a size-bounded buffer. At any time, the buffer can store at most B packets. Packets arrive over time. Each packet has a non-negative value and an integer deadline. In…
We numerically study confined channel foam flow around an obstacle using a two-dimensional bubble model, inspired by experiments performed in the same geometry. We systematically vary the polydispersity, the external driving force, and the…
Many recent caching systems aim to improve miss ratios, but there is no good sense among practitioners of how much further miss ratios can be improved. In other words, should the systems community continue working on this problem?…
Biomolecular motors use free energy to drive a variety of cellular tasks, including the transport of cargo, such as vesicles and organelles. We find that the widely-used `constant-force' approximation for the effect of cargo on motor…
When solving hard multicommodity network flow problems using an LP-based approach, the number of commodities is a driving factor in the speed at which the LP can be solved, as it is linear in the number of constraints and variables. The…
The economic warehouse lot scheduling problem is a foundational inventory-theory model, capturing computational challenges in dynamically coordinating replenishment decisions for multiple commodities subject to a shared capacity constraint.…
In the unsplittable flow problem on a path, we are given a capacitated path $P$ and $n$ tasks, each task having a demand, a profit, and start and end vertices. The goal is to compute a maximum profit set of tasks, such that for each edge…
We report the characteristics of the temporal fluctuations in the local force delivered to the wall of a 2D hopper by a granular medium flowing through it. The forces are predominantly impulsive at all flow rates for which the flow does not…
The plastic flow of a polycrystal is analyzed assuming grains as fine that the rate limiting process is grain boundary sliding, and grains readily accommodate their shapes by slip to preserve spatial continuity. It is shown that thinking of…
In this paper we show an O(n^(3/2) log^2 n) time algorithm for finding a maximum flow in a planar graph with multiple sources and multiple sinks. This is the fastest algorithm whose running time depends only on the number of vertices in the…
This paper introduces a novel theoretical framework and a suite of highly efficient, parallelizable algorithms for solving the large-scale multicommodity flow (MCF) feasibility problem. We reframe the classical constraint-satisfaction…