Skip to main content
Research
  1. Queen Mary University of London
  2. Research
  3. Publications

Publications: DR Justin Ward

Back to Search
Huang C-C, Ward J ( 2023 ) . FPT-Algorithms for the l-Matchoid Problem with a Coverage Objective . SIAM Journal on Discrete Mathematics
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, Thiery T, Ward J ( 2020 ) . Improved Multi-Pass Streaming Algorithms for Submodular Maximization with Matroid Constraints . Conference: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)62:1 - 62:19 .
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 ( 2017 ) . Better Guarantees for K-Means and Euclidean K-Median by Primal-Dual Algorithms . Conference: 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS)61 - 72 .
Sviridenko M, Vondrák J, Ward J ( 2017 ) . Optimal Approximation for Submodular and Supermodular Optimization with Bounded Curvature . Mathematics of Operations Research
Da Ponte Barbosa R, Ene A, Nguyên HL, Ward J ( 2016 ) . A New Framework for Distributed Submodular Maximization . Conference: 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS)645 - 654 .
Ward J, Živný S ( 2016 ) . Maximizing k-Submodular Functions and Beyond . ACM Transactions on Algorithms vol. 12 , ( 4 ) 1 - 26 .
Adamczyk M, Sviridenko M, Ward J ( 2016 ) . Submodular Stochastic Probing on Matroids . Mathematics of Operations Research vol. 41 , ( 3 ) 1022 - 1038 .
Makarychev K, Makarychev Y, Sviridenko M, Ward J, Jansen K, Mathieu C, Rolim JDP, Umans C ( 2016 ) . A Bi-Criteria Approximation Algorithm for k-Means . Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2016, September 7-9, 2016, Paris, France . vol. 60 , 14:1 - 14:20 .
Barbosa RDP, Ene A, Nguyen HL, Ward J, Bach FR, Blei DM ( 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 . 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, Mayr EW, Portier N ( 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 k -Submodular Functions . Conference: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms1468 - 1481 .
Sviridenko M, Ward J ( 2013 ) . Large Neighborhood Local Search for the Maximum Set Packing Problem . Lecture Notes in Computer Science . vol. 7965 , 792 - 803 .
Filmus Y, Ward J ( 2012 ) . A Tight Combinatorial Algorithm for Submodular Maximization Subject to a Matroid Constraint . Conference: 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science659 - 668 .
Ward J, Dürr C, Wilke T ( 2012 ) . A (k+3)/2-approximation algorithm for monotone submodular k-set packing and general k-exchange systems . 29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, February 29th - March 3rd, 2012, Paris, France . vol. 14 , 42 - 53 .
Filmus Y, Ward J, Dürr C, Wilke T ( 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 .
Feldman M, Naor JS, Schwartz R, Ward J ( 2011 ) . Improved Approximations for k-Exchange Systems . Lecture Notes in Computer Science . vol. 6942 , 784 - 798 .
Ward J, Kimmell G, Alexander P ( 2005 ) . Prufrock . Conference: Proceedings of the 20th IEEE/ACM International Conference on Automated Software Engineering423 - 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 .
Back to Search