相关论文: On the k-pairs problem

We present a heuristic for designing vector non-linear network codes for non-multicast networks, which we call quasi-linear network codes. The method presented has two phases: finding an approximate linear network code over the reals, and…

Consider n nodes connected to a single coordinator. Each node receives an individual online data stream of numbers and, at any point in time, the coordinator has to know the k nodes currently observing the largest values, for a given k…

In this paper, we consider the problem of assessing local clustering in complex networks. Various definitions for this measure have been proposed for the cases of networks having weighted edges, but less attention has been paid to both…

To reduce computational complexity and delay in randomized network coded content distribution (and for some other practical reasons), coding is not performed simultaneously over all content blocks but over much smaller subsets known as…

Consider the set of all digraphs on $[N]$ with $M$ edges, whose minimum in-degree and minimum out-degree are at least $k_1$ and $k_2$ respectively. For $k:=\min\{k_1,k_2\}\ge 2$ and $M/N>\max\{k_1,k_2\}$, $M=\Theta(N)$, we show that, among…

The Langberg-M\'{e}dard multiple unicast conjecture claims that for a strongly reachable $k$-pair network, there exists a multi-flow with rate $(1,1,\dots,1)$. In this paper, we show that the conjecture holds true for {\em stable} $3$-pair…

While degree correlations are known to play a crucial role for spreading phenomena in networks, their impact on the propagation speed has hardly been understood. Here we investigate a tunable spreading model on scale-free networks and show…

We investigate problems addressing combined connectivity augmentation and orientations settings. We give a polynomial-time 6-approximation algorithm for finding a minimum cost subgraph of an undirected graph $G$ that admits an orientation…

We investigate the time-complexity of the All-Pairs Max-Flow problem: Given a graph with $n$ nodes and $m$ edges, compute for all pairs of nodes the maximum-flow value between them. If Max-Flow (the version with a given source-sink pair…

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 consider the problem of finding a minimum edge cost subgraph of a graph satisfying both given node-connectivity requirements and degree upper bounds on nodes. We present an iterative rounding algorithm of the biset LP relaxation for this…

We consider the energy savings that can be obtained by employing network coding instead of plain routing in wireless multiple unicast problems. We establish lower bounds on the benefit of network coding, defined as the maximum of the ratio…

We study the parameterized complexity of a broad class of problems called "local graph partitioning problems" that includes the classical fixed cardinality problems as max k-vertex cover, k-densest subgraph, etc. By developing a technique…

The degree-diameter problem seeks to find the maximum possible order of a graph with a given (maximum) degree and diameter. It is known that graphs attaining the maximum possible value (the Moore bound) are extremely rare, but much activity…

Capacity scaling laws are analyzed in an underwater acoustic network with $n$ regularly located nodes on a square. A narrow-band model is assumed where the carrier frequency is allowed to scale as a function of $n$. In the network, we…

The outage probability limit is a fundamental and achievable lower bound on the word error rate of coded communication systems affected by fading. This limit is mainly determined by two parameters: the diversity order and the coding gain.…

Emerging optical and virtualization technologies enable the design of more flexible and demand-aware networked systems, in which resources can be optimized toward the actual workload they serve. For example, in a demand-aware datacenter…

Network coding is a technique to maximize communication rates within a network, in communication protocols for simultaneous multi-party transmission of information. Linear network codes are examples of such protocols in which the local…

Various methods have been proposed for creating a binary version of a complex network with valued ties. Rather than the default method of choosing a single threshold value about which to dichotomize, we consider a method of choosing the…

We prove lower bounds for the number of primes $p \leq N + b$ such that $p-b$ is divisible by $2^{k(N)}$ and has at most $k$ odd prime factors ($k \geq 2$), assuming $2^{k(N)} \leq N^\theta$ for some $\theta > 0$ depending on $k$. The proof…