Skip to main content
Research

Publications: DR Justin Ward

Thiery T, Ward J ( 2022 ) . Two-Sided Weak Submodularity for Matroid Constrained Optimization and Regression . Proceedings of Machine Learning Research . Conference: 35th Annual Conference on Learning Theory vol. 178 , 3605 - 3634 .
Huang C-C, Ward J ( 2020 ) . FPT-Algorithms for the \\ell-Matchoid Problem with a Coverage Objective .
Huang CC, Thiery T, Ward J ( 2020 ) . Improved multi-pass streaming algorithms for submodular maximization with matroid constraints . Leibniz International Proceedings in Informatics Lipics . vol. 176 ,
Ahmadian S, Norouzi-Fard A, Svensson O, Ward J ( 2019 ) . Better Guarantees for $k$-Means and Euclidean $k$-Median by Primal-Dual Algorithms . SIAM Journal on Computing vol. 49 , ( 4 )
Ahmadian S, Norouzi-Fard A, Svensson O, Ward J ( 2016 ) . Better Guarantees for k-Means and Euclidean k-Median by Primal-Dual\n Algorithms .
Ward J, Živný S ( 2016 ) . Maximizing\n <i>k</i>\n -Submodular Functions and Beyond . ACM Transactions on Algorithms vol. 12 , ( 4 ) 1 - 26 .
Makarychev K, Makarychev Y, Sviridenko M, Ward J ( 2015 ) . A bi-criteria approximation algorithm for $k$ Means .
Barbosa RDP, Ene A, Nguyen HL, Ward J ( 2015 ) . A New Framework for Distributed Submodular Maximization .
Barbosa RDP, Ene A, Nguyen HL, Ward J ( 2015 ) . The Power of Randomization: Distributed Submodular Maximization on Massive Datasets . Proceedings of the 32nd International Conference on Machine Learning . Conference: International Conference on Machine Learning Research ( Lille, France ) from: 07/07/2015 to: 09/07/2015 , vol. 37 , 1236 - 1244 .
Sviridenko M, Vondrák J, Ward J ( 2015 ) . Optimal approximation for submodular and supermodular optimization with bounded curvature . Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms . Conference: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms1134 - 1148 .
Filmus Y, Ward J ( 2014 ) . Monotone Submodular Maximization over a Matroid via Non-Oblivious Local Search . SIAM Journal on Computing vol. 43 , ( 2 ) 514 - 542 .
Adamczyk M, Sviridenko M, Ward J ( 2014 ) . Submodular Stochastic Probing on Matroids . 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), STACS 2014, March 5-8, 2014, Lyon, France . vol. 25 , 29 - 40 .
Ward J, Živný S ( 2014 ) . Maximizing Bisubmodular and <i>k</i>-Submodular Functions . Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms . Conference: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms1468 - 1481 .
Sviridenko M, Vondrák J, Ward J ( 2013 ) . Optimal approximation for submodular and supermodular optimization with\n bounded curvature .
Adamczyk M, Sviridenko M, Ward J ( 2013 ) . Submodular Stochastic Probing on Matroids .
Sviridenko M, Ward J ( 2013 ) . Large Neighborhood Local Search for the Maximum Set Packing Problem .
Filmus Y, Ward J ( 2012 ) . A Tight Combinatorial Algorithm for Submodular Maximization Subject to a\n Matroid Constraint .
Filmus Y, Ward J ( 2012 ) . The Power of Local Search: Maximum Coverage over a Matroid . 29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, February 29th - March 3rd, 2012, Paris, France . vol. 14 , 601 - 612 .
Ward J ( 2011 ) . A $(k + 3)/2$-approximation algorithm for monotone submodular\n maximization over a $k$-exchange system . 29th Symp. on Theoretical Aspects of Comp. Sci. (STACS 2012) 42-53 .
Feldman M, Naor J, Schwartz R, Ward J ( 2011 ) . Improved Approximations for k-Exchange Systems . 784 - 798 .
Ward J, Kimmell G, Alexander P ( 2005 ) . Prufrock . Proceedings of the 20th IEEE/ACM International Conference on Automated Software Engineering . Conference: ASE05: International Conference on Automated Software Engineering 2005423 - 426 .
Thiery T, Ward J . An Improved Approximation for Maximum Weighted k-Set Packing . Conference: ACM-SIAM Symposium on Discrete Algorithms ( Florence, Italy )
Harshaw C, Feldman M, Ward J, Karbasi A . Submodular Maximization beyond Non-negativity: Guarantees, Fast Algorithms, and Applications . Proceedings of Machine Learning Research . Conference: Proceedings of the 36th International Conference on Machine Learning (ICML '19) ( Long Beach, CA, USA ) vol. 97 , 2634 - 2643 .