• Publications
  • Influence
Modelling disease outbreaks in realistic urban social networks
The results suggest that outbreaks can be contained by a strategy of targeted vaccination combined with early detection without resorting to mass vaccination of a population. Expand
Mobile Data Offloading through Opportunistic Communications and Social Participation
This work proposes to exploit opportunistic communications to facilitate information dissemination in the emerging Mobile Social Networks (MoSoNets) and thus reduce the amount of mobile data traffic. Expand
Splitters and near-optimal derandomization
A fairly general method for finding deterministic constructions obeying k-restrictions, which yields structures of size not much larger than the probabilistic bound and imply the very efficient derandomization of algorithms in learning, of fixed-subgraph finding algorithms, and of near optimal /spl Sigma/II/Spl Sigma/ threshold formulae. Expand
Randomized Distributed Edge Coloring via an Extension of the Chernoff-Hoeffding Bounds
Fast and simple randomized algorithms for edge coloring a graph in the synchronous distributed point-to-point model of computation and new techniques for proving upper bounds on the tail probabilities of certain random variables which are not stochastically independent are introduced. Expand
Distributions on level-sets with applications to approximation algorithms
  • A. Srinivasan
  • Computer Science
  • Proceedings IEEE International Conference on…
  • 14 October 2001
This work considers a family of distributions on fixed-weight vectors in {0, 1}/sup t/ that enjoy certain negative correlation properties and also satisfy pre-specified conditions on their marginal distributions, and derives an approximation algorithm whose approximation guarantee is at least as good as what is known. Expand
Dependent rounding and its applications to approximation algorithms
We develop a new randomized rounding approach for fractional vectors defined on the edge-sets of bipartite graphs. We show various ways of combining this technique with other ideas, leading toExpand
Cellular traffic offloading through opportunistic communications: a case study
This work investigates the target-set selection problem for information delivery in the emerging Mobile Social Networks (MoSoNets), and proposes three algorithms, called Greedy, Heuristic, and Random, to exploit opportunistic communications to facilitate the information dissemination and thus reduce the amount of cellular traffic. Expand
Approximation Algorithms for Disjoint Paths and Related Routing and Packing Problems
Given a network and a set of connection requests on it, we consider the maximum edge-disjoint paths and related generalizations and routing problems that arise in assigning paths for these requests.Expand
A Client-Driven Approach for Channel Management in Wireless LANs
We propose an efficient client-based approach for channel management (channel assignment and load balancing) in 802.11-based WLANs that lead to better usage of the wireless spectrum. This approach isExpand
On the Complexity of Distributed Network Decomposition
In this paper, we improve the bounds for computing a network decomposition distributively and deterministically. Our algorithm computes an (n?(n),n?(n))-decomposition innO(?(n))time, whereformula. AsExpand