Justin Ward

Computational Theory and Mathematics · 2013–2019

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

Subfields

• Computational Theory and Mathematics — 16 citations into it; #8,867 of 12,182 by trust here, #9,306 by citations
• Artificial Intelligence — 12 citations into it; #27,868 of 35,345 by trust here, #31,361 by citations
• Optimization & Training — 9 citations into it; #2,229 of 2,601 by trust here, #2,428 by citations
• Computer Networks and Communications — 6 citations into it

Whom Justin Ward trusts overall

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

1. George L. Nemhauser
2. Ethan R. Elenberg
3. Maxim Sviridenko
4. Jan Vondr'ak
5. Alexander A. Ageev
6. Amit Deshpande
7. Jure Leskovec
8. Andreas Krause
9. Laurence A. Wolsey
10. Chandra Chekuri

Who trusts Justin Ward overall

1. Marwa El Halabi
2. Simon Lacoste-Julien
3. Suraj Srinivas
4. Andreas Krause

Papers from Justin Ward's perspective

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

1. An analysis of approximations for maximizing submodular set functions—I
2. A threshold of ln n for approximating set cover (preliminary version)
3. Best Algorithms for Approximating the Maximum of a Submodular Set Function
4. Pipage Rounding: A New Method of Constructing Algorithms with Proven Performance Guarantee (Journal of combinatorial optimization)
5. Maximizing the spread of influence through a social network
6. Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract) (Conference on Integer Programming and Combinatorial Optimization)
7. Lazier Than Lazy Greedy
8. A note on maximizing a submodular set function subject to a knapsack constraint (Operations Research Letters)
9. Near-optimal sensor placements in Gaussian processes
10. Optimal approximation for the submodular welfare problem in the value oracle model (Symposium on the Theory of Computing)

Their papers

• Optimal approximation for submodular and supermodular optimization with bounded curvature (2013) — 292 citations
• Submodular Maximization Beyond Non-negativity: Guarantees, Fast Algorithms, and Applications (2019) — 122 citations