39 citations · 118 across the 13 of their papers we have counts for
13 papers
Online Submodular Welfare Maximization: Greedy Beats 1/2 in Random Order
Nitish Korula, Vahab Mirrokni, Morteza Zadimoghaddam
In the Submodular Welfare Maximization (SWM) problem, the input consists of a set of items, each of which must be allocated to one of agents. Each agent has a valuat…
Online Allocation with Traffic Spikes: Mixing Adversarial and Stochastic Models
Hossein Esfandiari, Nitish Korula, Vahab Mirrokni
Motivated by Internet advertising applications, online allocation problems have been studied extensively in various adversarial and stochastic models. While the adversarial arrival…
An efficient reconciliation algorithm for social networks
Nitish Korula, Silvio Lattanzi
People today typically use multiple online social networks (Facebook, Twitter, Google+, LinkedIn, etc.). Each online network represents a subset of their "real" ego-networks. An in…
Connected Domatic Packings in Node-capacitated Graphs
Alina Ene, Nitish Korula, Ali Vakilian
A set of vertices in a graph is a dominating set if every vertex outside the set has a neighbor in the set. A dominating set is connected if the subgraph induced by its vertices is…
Approximability of Capacitated Network Design
Deeparnab Chakrabarty, Chandra Chekuri, Sanjeev Khanna +1
In the {\em capacitated} survivable network design problem (Cap-SNDP), we are given an undirected multi-graph where each edge has a capacity and a cost. The goal is to find a minim…
Overlap Number of Graphs
Daniel W. Cranston, Nitish Korula, Timothy D. LeSaulnier +4
An {\it overlap representation} of a graph assigns sets to vertices so that vertices are adjacent if and only if their assigned sets intersect with neither containing the other…