Amin Saberi

Statistical and Nonlinear Physics · 2002–2018

A researcher in the Science corpus: 11 papers; trusts 24 researchers and is trusted by 21 researchers here, as inferred from the citation graph.

Subfields

• Statistical and Nonlinear Physics — 24 citations into it; #7,102 of 10,127 by trust here, #7,024 by citations
• Management Science and Operations Research — 19 citations into it; #3,162 of 11,946 by trust here, #3,705 by citations
• Computational Theory and Mathematics — 17 citations into it; #7,569 of 12,182 by trust here, #3,562 by citations
• Computer Networks and Communications — 17 citations into it; #1,504 of 9,886 by trust here, #1,297 by citations
• Economics and Econometrics — 14 citations into it; #20,648 of 23,481 by trust here, #20,730 by citations
• Geometry and Topology — 12 citations into it
• Organizational Behavior and Human Resource Management — 8 citations into it; #3,262 of 8,741 by trust here, #4,387 by citations
• Industrial and Manufacturing Engineering — 7 citations into it; #233 of 2,521 by trust here, #547 by citations

Whom Amin Saberi trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

1. Kamal Kumar Jain
2. Yoav Freund
3. Vijay Arya
4. Anna Bogomolnaia
5. Robert E. Schapire
6. Moses Charikar
7. Sudipto Guha
8. Daron Acemoglu
9. Fabián A. Chudak
10. Vijay V. Vazirani

Who trusts Amin Saberi overall

1. Aranyak Mehta
2. Niv Buchbinder
3. Benjamin E. Birnbaum
4. J. P. Gleeson
5. Shi Li
6. Kamal Kumar Jain
7. Mohammad Mahdian
8. Kenneth J. Goldman
9. Matthew O. Jackson
10. Paul Dütting

Papers from Amin Saberi's perspective

Ordered by how strongly the researchers Amin Saberi trusts endorse each paper. Same corpus, a different order for every researcher.

1. Primal-dual approximation algorithms for metric facility location and k-median problems
2. Approximation algorithms for facility location problems
3. Analysis of a local search heuristic for facility location problems (ACM-SIAM Symposium on Discrete Algorithms)
4. Local search heuristic for k-median and facility location problems (Symposium on the Theory of Computing)
5. Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP (JACM)
6. A new greedy approach for facility location problems
7. The Probabilistic Method
8. Game theory, on-line prediction and boosting
9. A constant-factor approximation algorithm for the k-median problem (extended abstract)
10. Local Search Heuristics for k-Median and Facility Location Problems

Their papers

• A new greedy approach for facility location problems (2002) — 482 citations
• Market equilibrium via a primal-dual-type algorithm (2002) — 314 citations
• AdWords and generalized on-line matching (2005) — 944 citations
• Minimizing Effective Resistance of a Graph (2008) — 542 citations
• Assignment Mechanisms under Distributional Constraints (2018) — 26 citations
• On approximately fair allocations of indivisible goods (2004) — 738 citations
• Random walks in peer-to-peer networks (2004) — 622 citations
• The spread of innovations in social networks (2010) — 409 citations
• Asymptotic behavior and distributional limits of preferential attachment graphs (2014) — 111 citations
• Binary Opinion Dynamics with Stubborn Agents (2013) — 345 citations
• Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP (2002) — 509 citations