Related papers: A tight bound on the speed-up through storage for …
The cargo motion in living cells transported by two species of motor protein with different intrinsic directionality is discussed in this study. Similar to single motor movement, cargo steps forward and backward along microtubule…
In this paper we describe a new algorithm for buffered global routing according to a prescribed buffer site map. Specifically, we describe a provably good multi-commodity flow based algorithm that finds a global routing minimizing buffer…
This paper researches combinatorial algorithms for the multi-commodity flow problem. We relax the capacity constraints and introduce a penalty function $h$ for each arc. If the flow exceeds the capacity on arc $a$, arc $a$ would have a…
Any physical system evolves at a finite speed that is constrained not only by the energetic cost but also by the topological structure of the underlying dynamics. In this Letter, by considering such structural information, we derive a…
We establish rigorous lower bounds on the speed of traveling fronts and on the bulk burning rate in reaction-diffusion equation with passive advection. The non-linearity is assumed to be of either KPP or ignition type. We consider two main…
Heavy particles in turbulent flows have been shown to accumulate in regions of high strain rate or low vorticity, a process otherwise known as preferential concentration. This can be observed in geophysical flows, and is inferred to occur…
In the $2$-Machine Flow Shop problem with exact delays the operations of each job are separated by a given time lag (delay). Leung et al. (2007) established that the problem is strongly NP-hard when the delays may have at most two different…
In this paper we provide an algorithm which given any $m$-edge $n$-vertex directed graph with integer capacities at most $U$ computes a maximum $s$-$t$ flow for any vertices $s$ and $t$ in $m^{4/3+o(1)}U^{1/3}$ time. This improves upon the…
Network traffic analysis increasingly uses complex machine learning models as the internet consolidates and traffic gets more encrypted. However, over high-bandwidth networks, flows can easily arrive faster than model inference rates. The…
Dynamic network flows, sometimes called flows over time, extend the notion of network flows to include a transit time for each edge. While Ford and Fulkerson showed that certain dynamic flow problems can be solved via a reduction to static…
A transition rate model of cargo transport by $N$ molecular motors is proposed. Under the assumption of steady state, the force-velocity curve of multi-motor system can be derived from the force-velocity curve of single motor. Our work…
We study flow scheduling under node capacity constraints. We are given capacitated nodes and an online sequence of jobs, each with a release time and a demand to be routed between two nodes. A schedule specifies which jobs are routed in…
We investigate minimal bounded speedups of Toeplitz flows. We demonstrate that the minimal bounded speedup of a Toeplitz flow need not be another Toeplitz flow and describe techniques for determining whether the resulting speedup is…
Coherence is the most fundamental quantum resource in quantum information processing. How fast a physical system gets coherence or decoherence is a critical ingredient. We present an attainable quantum speed limit based on the variation of…
We consider the fully dynamic bin packing problem, where items arrive and depart in an online fashion and repacking of previously packed items is allowed. The goal is, of course, to minimize both the number of bins used as well as the…
We consider the problem of forwarding packets arriving online with their destinations in a line network. In each time step, each router can forward one packet along the edge to its right. Each packet that is forwarded arrives at the next…
This paper provides a bound for the supremum of sample averages over a class of functions for a general class of mixing stochastic processes with arbitrary mixing rates. Regardless of the speed of mixing, the bound is comprised of a…
We give the first local algorithm for computing multi-commodity flow and apply it to obtain a $(1+\epsilon)$-approximate algorithm for computing a $k$-commodity flow on an expander with $m$ edges in $(m+\epsilon^{-3}k^3D)n^{o(1)}$ time,…
Recent developments in modular transport vehicles allow deploying multi-purpose vehicles which can alternately transport different kinds of flows. In this study, we propose a novel variant of the pickup and delivery problem, the…
In this paper we provide an algorithm which given any $m$-edge $n$-vertex directed graph with integer capacities at most $U$ computes a maximum $s$-$t$ flow for any vertices $s$ and $t$ in $m^{11/8+o(1)}U^{1/4}$ time with high probability.…