Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Justin Ward
Observed name:
Ward, Justin
Institution:
Queen Mary University of London
Observed institutions:
Queen Mary University of London,
University of Toronto,
University of Warwick,
University of Oxford,
École Polytechnique Fédérale de Lausanne
ORCID:
0000-0002-5353-4554
Observed ORCID:
0000-0002-5353-4554
OpenAlex ID:
A5062913985
Optimal Approximation for Submodular and Supermodular Optimization with Bounded Curvature
2017
·
Maxim Sviridenko
, Jan Vondrák
, et al.
·
Mathematics of Operations Research
·
249
PDF
Better Guarantees for $k$-Means and Euclidean $k$-Median by Primal-Dual Algorithms
2019
·
Sara Ahmadian
, Ashkan Norouzi-Fard
, et al.
·
SIAM Journal on Computing
·
179
PDF
Better Guarantees for k-Means and Euclidean k-Median by Primal-Dual Algorithms
2017
·
Sara Ahmadian
, Ashkan Norouzi-Fard
, et al.
·
Annual Symposium on Foundations of Computer Science
·
167
Monotone Submodular Maximization over a Matroid via Non-Oblivious Local Search
2014
·
Yuval Filmus
, Justin Ward
·
SIAM Journal on Computing
·
141
Submodular Maximization Beyond Non-negativity: Guarantees, Fast Algorithms, and Applications
2019
·
Harshaw, Christopher
, Feldman, Moran
, et al.
·
arXiv (Cornell University)
·
128
PDF
The Power of Randomization: Distributed Submodular Maximization on Massive Datasets
2015
·
Rafael da Ponte Barbosa
, Alina Ene
, et al.
·
arXiv (Cornell University)
·
96
Maximizing k -Submodular Functions and Beyond
2016
·
Justin Ward
, Stanislav Živný
·
ACM Transactions on Algorithms
·
86
PDF
A Tight Combinatorial Algorithm for Submodular Maximization Subject to a Matroid Constraint
2012
·
Yuval Filmus
, Justin Ward
·
Annual Symposium on Foundations of Computer Science
·
83
PDF
Optimal approximation for submodular and supermodular optimization with bounded curvature
2014
·
Maxim Sviridenko
, Jan Vondrák
, et al.
·
ACM-SIAM Symposium on Discrete Algorithms (SODA)
·
81
A New Framework for Distributed Submodular Maximization
2016
·
Rafael Da Ponte Barbosa
, Alina Ene
, et al.
·
Annual Symposium on Foundations of Computer Science
·
71
Improved Approximations for k-Exchange Systems
2011
·
Moran Feldman
, Joseph Naor
, et al.
·
Lecture notes in computer science
·
66
A New Framework for Distributed Submodular Maximization
2015
·
Barbosa, Rafael da Ponte
, Ene, Alina
, et al.
·
arXiv (Cornell University)
·
62
PDF
Submodular Stochastic Probing on Matroids
2016
·
Marek Adamczyk
, Maxim Sviridenko
, et al.
·
Mathematics of Operations Research
·
60
The Power of Local Search: Maximum Coverage over a Matroid
2012
·
Filmus, Yuval
, Ward, Justin
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
41
PDF
Maximizing Bisubmodular and k-Submodular Functions
2013
·
Justin Ward
, Stanislav Živný
·
ACM-SIAM Symposium on Discrete Algorithms (SODA)
·
40
Large Neighborhood Local Search for the Maximum Set Packing Problem
2013
·
Maxim Sviridenko
, Justin Ward
·
Lecture notes in computer science
·
40
An Improved Approximation for Maximum Weighted k -Set Packing
2023
·
Theophile Thiery
, Justin Ward
·
Society for Industrial and Applied Mathematics eBooks
·
38
A (k+3)/2-approximation algorithm for monotone submodular k-set packing and general k-exchange systems
2012
·
Ward, Justin
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
31
PDF
The Power of Randomization: Distributed Submodular Maximization on Massive Datasets
2015
·
Barbosa, Rafael da Ponte
, Ene, Alina
, et al.
·
arXiv (Cornell University)
·
26
PDF
A Bi-Criteria Approximation Algorithm for k-Means
2016
·
Makarychev, Konstantin
, Makarychev, Yury
, et al.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
23
PDF
Submodular Stochastic Probing on Matroids
2014
·
Adamczyk, Marek
, Sviridenko, Maxim
, et al.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
21
PDF
FPT-Algorithms for the \(\ell\) -Matchoid Problem with a Coverage Objective
2023
·
Chien-Chung Huang
, Justin Ward
·
SIAM Journal on Discrete Mathematics
·
13
PDF
A bi-criteria approximation algorithm for $k$ Means
2015
·
Makarychev, Konstantin
, Makarychev, Yury
, et al.
·
arXiv (Cornell University)
·
13
PDF
Oblivious and non-oblivious local search for combinatorial optimization
2012
·
Allan Borodin
, Justin Ward
·
TSpace (University of Toronto)
·
12
PDF
Maximizing Bisubmodular and k-Submodular Functions
·
Justin Ward
·
11
Show more works
View as search
Works count:
39
Citation count:
1,840
H-index:
21
I10-index:
26
Year
Topic
Type