Mohammad Mahdian

Computer Networks and Communications · 2002–2011

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

Subfields

• Computer Networks and Communications — 12 citations into it; #1,618 of 9,886 by trust here, #3,005 by citations
• Organizational Behavior and Human Resource Management — 8 citations into it; #3,261 of 8,741 by trust here, #4,387 by citations
• Industrial and Manufacturing Engineering — 7 citations into it; #2,117 of 2,521 by trust here, #1,388 by citations
• Computational Theory and Mathematics — 5 citations into it; #2,753 of 12,182 by trust here, #5,046 by citations
• Management Science and Operations Research — 5 citations into it

Whom Mohammad Mahdian trusts overall

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

1. Aranyak Mehta
2. Kamal Kumar Jain
3. Gagan Goel
4. Vijay Arya
5. Jon Feldman
6. Moses Charikar
7. Vijay V. Vazirani
8. Sudipto Guha
9. Fabián A. Chudak
10. Yinyu Ye

Who trusts Mohammad Mahdian overall

1. Aranyak Mehta
2. Paul Dütting
3. Susanne Albers
4. Jaroslaw Byrka
5. Shi Li
6. Benjamin E. Birnbaum
7. Silvio Lattanzi
8. Arindam Khan
9. Vijay Arya
10. Thomas W. Pensyl

Papers from Mohammad Mahdian's perspective

Ordered by how strongly the researchers Mohammad Mahdian 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. A new greedy approach for facility location problems
5. Local search heuristic for k-median and facility location problems (Symposium on the Theory of Computing)
6. Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue (Embedded Systems and Applications)
7. AdWords and generalized on-line matching (IEEE Annual Symposium on Foundations of Computer Science)
8. A constant-factor approximation algorithm for the k-median problem (extended abstract)
9. Approximation algorithms for facility location problems
10. Algorithms for facility location problems with outliers (ACM-SIAM Symposium on Discrete Algorithms)

Their papers

• A new greedy approach for facility location problems (2002) — 482 citations
• Online bipartite matching with random arrivals: an approach based on strongly factor-revealing LPs (2011) — 300 citations
• Influence and correlation in social networks (2008) — 772 citations
• Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP (2002) — 509 citations