( en | de | ru )

 

Disambiguation of "Ward, Justin"

Author of the publication

copydeleteadd this publication to your clipboard
Better Guarantees for k-Means and Euclidean k-Median by Primal-Dual Algorithms.

, , , and . SIAM J. Comput., (2020)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Aoife Ward

James Ward

Ward Gasque

Beate Ward

Derek Ward

 

Other publications of authors with the same name

Submodular Stochastic Probing on Matroids., , and . STACS, volume 25 of LIPIcs, page 29-40. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2014)Oblivious and Non-oblivious Local Search for Combinatorial Optimization.. University of Toronto, Canada, (2013)Submodular Maximization beyond Non-negativity: Guarantees, Fast Algorithms, and Applications., , , and . ICML, volume 97 of Proceedings of Machine Learning Research, page 2634-2643. PMLR, (2019)The Power of Randomization: Distributed Submodular Maximization on Massive Datasets., , , and . ICML, volume 37 of JMLR Workshop and Conference Proceedings, page 1236-1244. JMLR.org, (2015)A New Framework for Distributed Submodular Maximization., , , and . FOCS, page 645-654. IEEE Computer Society, (2016)A Tight Combinatorial Algorithm for Submodular Maximization Subject to a Matroid Constraint., and . FOCS, page 659-668. IEEE Computer Society, (2012)Large Neighborhood Local Search for the Maximum Set Packing Problem., and . ICALP (1), volume 7965 of Lecture Notes in Computer Science, page 792-803. Springer, (2013)Better Guarantees for k-Means and Euclidean k-Median by Primal-Dual Algorithms., , , and . SIAM J. Comput., (2020)Optimal approximation for submodular and supermodular optimization with bounded curvature., , and . SODA, page 1134-1148. SIAM, (2015)Improved Multi-Pass Streaming Algorithms for Submodular Maximization with Matroid Constraints., , and . APPROX-RANDOM, volume 176 of LIPIcs, page 62:1-62:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)