This paper deals with approximation algorithms for the prize collecting generalized Steiner forest problem, defined as follows. The input is an undirected graph G = (V, E), a colle...
Motivated by several marketplace applications on rapidly growing online social networks, we study the problem of efficient offline matching algorithms for online exchange markets....
We present a distributed algorithm that finds a maximal edge packing in O(∆ + log∗ W) synchronous communication rounds in a weighted graph, independent of the number of nodes...
In this paper, we consider the problem of throughput maximization in an infrastructure based WLAN. We demonstrate that most of the proposed protocols though perform optimally for ...
Real-world networks often need to be designed under uncertainty, with only partial information and predictions of demand available at the outset of the design process. The field ...