V. Mirrokni

Publications
Influence

Locality-sensitive hashing scheme based on p-stable distributions

Mayur Datar, N. Immorlica, P. Indyk, V. Mirrokni
Computer Science, Mathematics
SCG '04
8 June 2004

We present a novel Locality-Sensitive Hashing scheme for the Approximate Nearest Neighbor Problem under lp norm, based on p-stable distributions. Expand

2,505
430
PDF

Maximizing Non-monotone Submodular Functions

U. Feige, V. Mirrokni, J. Vondrák
Mathematics, Computer Science
SIAM J. Comput.
1 July 2011

In this paper, we design the first constant-factor approximation algorithms for maximizing nonnegative (non-monotone) submodular functions. Expand

Optimal marketing strategies over social networks

J. Hartline, V. Mirrokni, M. Sundararajan
Computer Science
WWW
21 April 2008

We discuss the use of social networks in implementing viral marketing strategies. While influence maximization has been studied in this context (see Chapter 24 of [10]), we study revenue… Expand

Maximizing Non-Monotone Submodular Functions

U. Feige, V. Mirrokni, J. Vondrák
Computer Science
48th Annual IEEE Symposium on Foundations of…
2007

Submodular maximization generalizes many important problems including Max Cut in directed/undirected graphs, certain constraint satisfaction problems and maximum facility location problems. Expand

Online Stochastic Matching: Beating 1-1/e

J. Feldman, Aranyak Mehta, V. Mirrokni, S. Muthukrishnan
Mathematics, Computer Science
50th Annual IEEE Symposium on Foundations of…
25 May 2009

Our main result is a $0.67$-approximation online algorithm for stochastic bipartite matching, breaking this $1 - {1\over e}$ barrier. Expand

Approximating submodular functions everywhere

M. Goemans, Nicholas J. A. Harvey, S. Iwata, V. Mirrokni
Computer Science, Mathematics
SODA
4 January 2009

We consider the problem of approximating a non-negative, monotone, submodular function f on a ground set of size n everywhere, after only poly(n) oracle queries. Expand

Sink equilibria and convergence

M. Goemans, V. Mirrokni, A. Vetta
Mathematics, Computer Science
46th Annual IEEE Symposium on Foundations of…
23 October 2005

We introduce the concept of a sink equilibrium. A sink equilibrium is a strongly connected component with no outgoing arcs in the strategy profile graph associated with a game. The strategy profile… Expand

Non-monotone submodular maximization under matroid and knapsack constraints

Jon Lee, V. Mirrokni, V. Nagarajan, M. Sviridenko
Computer Science, Mathematics
STOC '09
2 February 2009

Submodular function maximization is a central problem in combinatorial optimization, generalizing many important problems including Max Cut in directed/undirected graphs and in hypergraphs, certain constraint satisfaction problems, maximum entropy sampling, and maximum facility location problems. Expand

Maximizing Non-Monotone Submodular Functions

U. Feigc, V. Mirrokni, J. Vondrák
Computer Science
FOCS
21 October 2007

Submodular maximization generalizes many important problems including Max Cut in directed/undirected graphs and hypergraphs, certain constraint satisfaction problems and maximum facility location problems. Expand

Tight approximation algorithms for maximum general assignment problems

Lisa Fleischer, M. Goemans, V. Mirrokni, M. Sviridenko
Mathematics
SODA
22 January 2006

A separable assignment problem (SAP) is defined by a set of bins and a set of items to pack in each bin; a value, f ij , for assigning item j to bin i; and a separate packing constraint for each bin… Expand

Recommended Authors