We present the first polynomial-time approximation scheme (PTAS) for the Minimum Independent Dominating Set problem in graphs of polynomially bounded growth. Graphs of bounded gr...
This article proposes a flexible and distributed stochastic automaton-based network partitioning algorithm that is capable of finding the optimal k-way partition with respect to a...
Yan Wan, Sandip Roy, Ali Saberi, Bernard C. Lesieu...
In this paper, we consider transmission in relatively wide-stretched power line communication (PLC) networks, where repeaters are required to bridge the source-to-destination dista...
— Ad hoc and wireless sensor networks have recently emerged as successful technologies in a number of application domains. The need to build security services into them remains h...
Abstract— Motivated by applications to sensor, peer-topeer and ad hoc networks, we study distributed asynchronous algorithms, also known as gossip algorithms, for computation and...
Stephen P. Boyd, Arpita Ghosh, Balaji Prabhakar, D...