Obserwuj
Justin Ward
Tytuł
Cytowane przez
Cytowane przez
Rok
Better Guarantees for -Means and Euclidean -Median by Primal-Dual Algorithms
S Ahmadian, A Norouzi-Fard, O Svensson, J Ward
SIAM Journal on Computing 49 (4), FOCS17-97-FOCS17-156, 2019
2032019
Optimal approximation for submodular and supermodular optimization with bounded curvature
M Sviridenko, J Vondrák, J Ward
Mathematics of Operations Research 42 (4), 1197-1218, 2017
2012017
The power of randomization: Distributed submodular maximization on massive datasets
R Barbosa, A Ene, H Nguyen, J Ward
International Conference on Machine Learning, 1236-1244, 2015
892015
A tight combinatorial algorithm for submodular maximization subject to a matroid constraint
Y Filmus, J Ward
2012 IEEE 53rd Annual Symposium on Foundations of Computer Science, 659-668, 2012
802012
A new framework for distributed submodular maximization
RP Barbosa, A Ene, HL Nguyen, J Ward
2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS …, 2016
672016
Submodular stochastic probing on matroids
M Adamczyk, M Sviridenko, J Ward
Mathematics of Operations Research 41 (3), 1022-1038, 2016
642016
Monotone submodular maximization over a matroid via non-oblivious local search
Y Filmus, J Ward
SIAM Journal on Computing 43 (2), 514-542, 2014
642014
Submodular maximization beyond non-negativity: Guarantees, fast algorithms, and applications
C Harshaw, M Feldman, J Ward, A Karbasi
International Conference on Machine Learning, 2634-2643, 2019
582019
Improved approximations for k-exchange systems
M Feldman, JS Naor, R Schwartz, J Ward
European Symposium on Algorithms, 784-798, 2011
452011
A bi-criteria approximation algorithm for k-Means
K Makarychev, Y Makarychev, M Sviridenko, J Ward
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2016
432016
The power of local search: Maximum coverage over a matroid
Y Filmus, J Ward
STACS'12 (29th Symposium on Theoretical Aspects of Computer Science) 14, 601-612, 2012
332012
Large Neighborhood Local Search for the Maximum Set Packing Problem
M Sviridenko, J Ward
ICALP 2013: 40th International Colloquium on Automata, Languages, and …, 2013
302013
A (k+ 3)/2-approximation algorithm for monotone submodular k-set packing and general k-exchange systems
J Ward
Symposium on Theoretical Aspects of Computer Science 14, 42-53, 2012
282012
Maximizing k-Submodular Functions and Beyond
J Ward, S Živný
ACM Transactions on Algorithms (TALG) 12 (4), 1-26, 2016
242016
Maximizing Bisubmodular and k-Submodular Functions
J Ward, S Živný
Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete …, 2014
242014
Oblivious and non-oblivious local search for combinatorial optimization
J Ward
University of Toronto (Canada), 2012
112012
Improved multi-pass streaming algorithms for submodular maximization with matroid constraints
CC Huang, T Thiery, J Ward
arXiv preprint arXiv:2102.09679, 2021
52021
Prufrock: A framework for constructing polytypic theorem provers
J Ward, G Kimmell, P Alexander
Proceedings of the 20th IEEE/ACM international Conference on Automated …, 2005
22005
Two-sided weak submodularity for matroid constrained optimization and regression
T Thiery, J Ward
arXiv preprint arXiv:2102.09644, 2021
12021
FPT-Algorithms for the l-Matchoid Problem with Linear and Submodular Objectives.
CC Huang, J Ward
CoRR, abs/2011.06268, 2020
12020
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20