—A fundamental problem in wireless networks is to estimate its throughput capacity - given a set of wireless nodes, and a set of connections, what is the maximum rate at which da...
Deepti Chafekar, V. S. Anil Kumar, Madhav V. Marat...
We consider approximation algorithms for non-uniform buy-at-bulk network design problems. The first nontrivial approximation algorithm for this problem is due to Charikar and Kar...
Chandra Chekuri, Mohammad Taghi Hajiaghayi, Guy Ko...
Bayesian networks (BNs) have been widely used as a model for knowledge representation and probabilistic inferences. However, the single probability representation of conditional d...
In this paper, we present a MAC-Iayer packet scheduling algorithm called BPA, for real-time switched Ethernet networks. BPA considers a message model where trans-node application-...
In this paper, we study the Maximum lifetime Target Coverage problem (MTC), which is to maximize the network lifetime while guaranteeing the complete coverage of all the targets. ...