Related papers: A note on the ring loading problem
Optimal percolation is the problem of finding the minimal set of nodes such that if the members of this set are removed from a network, the network is fragmented into non-extensive disconnected clusters. The solution of the optimal…
This paper studies the shuffling phase in a distributed computing model with rate-limited links between nodes. Each node is connected to all other nodes via a noiseless broadcast link with a finite capacity. For this network, the shuffling…
In this paper we study a revenue maximization problem for optical routing nodes. We model the routing node as a single server polling model with the aim to assign visit periods (service windows) to the different stations (ports) such that…
A lower bound on the capacity of the split-step Fourier channel is derived. The channel under study is a concatenation of smaller segments, within which three operations are performed on the signal, namely, nonlinearity, linearity, and…
The network coding problem asks whether data throughput in a network can be increased using coding (compared to treating bits as commodities in a flow). While it is well-known that a network coding advantage exists in directed graphs, the…
We consider a routing problem which plays an important role in several applications, primarily in communication network planning and VLSI layout design. The original underlying graph algorithmic task is called Disjoint Paths problem. In…
Network coding is a new technique to transmit data through a network by letting the intermediate nodes combine the packets they receive. Given a network, the network coding solvability problem decides whether all the packets requested by…
We consider the problem of multicommodity flows in outerplanar graphs. Okamura and Seymour showed that the cut-condition is sufficient for routing demands in outerplanar graphs. We consider the unsplittable version of the problem and prove…
In this work, we develop a new framework for dynamic network flow problems based on optimal transport theory. We show that the dynamic multi-commodity minimum-cost network flow problem can be formulated as a multi-marginal optimal transport…
We consider an off-line optimisation problem where $k$ robots must service $n$ requests on a single line. A request $i$ has weight $w_i$ and takes place at time $t_i$ at location $d_i$ on the line. A robot can service a request and collect…
We study the routing problem for vehicles with limited energy through a network of inhomogeneous charging nodes. This is substantially more complicated than the homogeneous node case studied in [1]. We seek to minimize the total elapsed…
We study message transport on a $1-d$ ring of nodes and randomly distributed hubs. Messages are deposited on the network at a constant rate. When the rate at which messages are deposited on the lattice is very high, messages start…
Research on container loading problems has been proved effective in increasing the filling rate of containers in different practical situations. However, the broader logistic context might pressure the loading process, leading to…
Input to the Load Balanced Demand Distribution (LBDD) consists of the following: (a) a set of service centers; (b) a set of demand nodes and; (c) a cost matrix containing the cost of assignment for each (demand node, service center) pair.…
There are distributed graph algorithms for finding maximal matchings and maximal independent sets in $O(\Delta + \log^* n)$ communication rounds; here $n$ is the number of nodes and $\Delta$ is the maximum degree. The lower bound by Linial…
Throughput is a main performance objective in communication networks. This paper considers a fundamental maximum throughput routing problem -- the all-or-nothing multicommodity flow (ANF) problem -- in arbitrary directed graphs and in the…
We consider a quasi two-dimensional network connection growth model that minimizes the wiring cost while maximizing the network connections, but at the same time edge crossings are penalized or forbidden. This model is mapped to a dilute…
We use information theoretic achievable rate formulas for the multi-relay channel to study the problem of optimal placement of relay nodes along the straight line joining a source node and a sink node. The achievable rate formulas that we…
Online bin stretching is an online packing problem where some of the best known lower and upper bounds were found through computational searches. The limiting factor in obtaining better bounds with such methods is the computational time…
We study the wireless scheduling problem in the SINR model. More specifically, given a set of $n$ links, each a sender-receiver pair, we wish to partition (or \emph{schedule}) the links into the minimum number of slots, each satisfying…