• Publications
  • Influence
On approximately fair allocations of indivisible goods
In the presence of indivisibilities, it is shown that there exist allocations in which the envy is bounded by the maximum marginal utility, and an algorithm for computing such allocations is presented. Expand
Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP
The method of dual fitting and the idea of factor-revealing LP are formalized and used to design and analyze two greedy algorithms for the metric uncapacitated facility location problem. Expand
A new greedy approach for facility location problems
A simple and natural greedy algorithm for the metric uncapacitated facility location problem achieving an approximation guarantee of 1.61 and proving a lower bound of 1+2/e on the approximability of the k-median problem. Expand
Random walks in peer-to-peer networks
It is shown that samples taken from consecutive steps of a random walk can achieve statistical properties similar to independent sampling if the second eigenvalue of the transition matrix is hounded away from 1, which translates to good expansion of the network. Expand
Minimizing Effective Resistance of a Graph
It is shown that optimal allocation of the edge weights can reduce the total effective resistance of the graph (compared to uniform weights) by a factor that grows unboundedly with the size of thegraph. Expand
AdWords and Generalized On-line Matching
The notion of a tradeoff revealing LP is introduced and used to derive two optimal algorithms achieving competitive ratios of 1-1/e for this problem of online bipartite matching. Expand
An approximation algorithm for max-min fair allocation of indivisible goods
This paper gives the first approximation algorithm for the problem of max-min fair allocation of indivisible goods and designs an iterative method for rounding a fractional matching on a tree which might be of independent interest. Expand
A Randomized Rounding Approach to the Traveling Salesman Problem
This work gives a (3/2-\eps_0)-approximation algorithm that finds a spanning tree whose cost is upper bounded by the optimum, then it finds the minimum cost Eulerian augmentation (or T-join) of that tree. Expand
The spread of innovations in social networks
  • A. Montanari, A. Saberi
  • Computer Science, Medicine
  • Proceedings of the National Academy of Sciences
  • 12 November 2010
This paper characterizes the rate of convergence as a function of the structure of the interaction network and considers scenarios where the individuals’ behavior is the result of a strategic choice among competing alternatives based on the dynamics of coordination games. Expand
An O(log n/ log log n)-approximation algorithm for the asymmetric traveling salesman problem
A randomized algorithm is derived which delivers a solution within a factor O(log n/ log log n) of the optimum of the Asymmetric Traveling Salesman problem with high probability. Expand