Abstract— This paper studies routing schemes and their distributed construction in limited wireless networks, such as sensor or mesh networks. We argue that the connectivity of s...
In this paper, we give the first constant-approximations for a number of layered network design problems. We begin by modeling hierarchical caching, where caches are placed in la...
In the Survivable Network Design Problem (SNDP) the goal is to find a minimum cost subset of edges that satisfies a given set of pairwise connectivity requirements among the ver...
—In this paper, a lattice-reduction-aided (LRA) With such an approximation, the complexity of VP is greatly minimum mean square error (MMSE) vector precoding (VP) is reduced. pro...
The Steiner tree problem asks for a minimum cost tree spanning a given set of terminals S ⊆ V in a weighted graph G = (V, E, c), c : E → R+ . In this paper we consider a genera...