117 citations · 704 across the 174 of their papers we have counts for
5 papers · 1 filter
ASYMP: Fault-tolerant Mining of Massive Graphs
Eduardo Fleury, Silvio Lattanzi, Vahab Mirrokni +1
We present ASYMP, a distributed graph processing system developed for the timely analysis of graphs with trillions of edges. ASYMP has several distinguishing features including a r…
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…
Coresets Meet EDCS: Algorithms for Matching and Vertex Cover on Massive Graphs
Sepehr Assadi, MohammadHossein Bateni, Aaron Bernstein +2
As massive graphs become more prevalent, there is a rapidly growing need for scalable algorithms that solve classical graph problems, such as maximum matching and minimum vertex co…
Overcommitment in Cloud Services -- Bin packing with Chance Constraints
Maxime C. Cohen, Philipp W. Keller, Vahab Mirrokni +1
This paper considers a traditional problem of resource allocation, scheduling jobs on machines. One such recent application is cloud computing, where jobs arrive in an online fashi…