Dr Justin Ward
Senior Lecturer in Optimisation
Lead for Research Innovation and External Stakeholders Engagement of the Centre for Combinatorics, Algebra and Number Theory
School of Mathematical Sciences
Queen Mary University of London
Queen Mary University of London
Publications
Publications of specific relevance to the Centre for Combinatorics, Algebra and Number Theory2023
FPT-Algorithms for the l-Matchoid Problem with a Coverage ObjectiveHuang C-C Ward J
Siam Journal on Discrete Mathematics, Society For Industrial and Applied Mathematics
15-06-2023
2022
Two-Sided Weak Submodularity for Matroid Constrained Optimization and RegressionThiery T Ward J
35th Annual Conference on Learning Theory. vol. 178, 3605-3634.
01-01-2022
2020
Improved Multi-Pass Streaming Algorithms for Submodular Maximization with Matroid ConstraintsHuang C-C Thiery T Ward J
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)., 62:1-62:19.
11-08-2020
2019
Better Guarantees for $k$-Means and Euclidean $k$-Median by Primal-Dual AlgorithmsAhmadian S Norouzi-Fard A Svensson O Ward J
Siam Journal on Computing, Society For Industrial and Applied Mathematics vol. 49 (4), 97-156.
22-10-2019
2017
Optimal Approximation for Submodular and Supermodular Optimization with Bounded CurvatureSviridenko M Vondrák J Ward J
Mathematics of Operations Research
16-05-2017
2016
A New Framework for Distributed Submodular MaximizationBarbosa RDP Ene A Nguyen HL Ward J Dinur I
IEEE 57th Annual Symposium on Foundations of Computer Science, FOCS 2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey, USA., 645-654.
01-01-2016
A Bi-Criteria Approximation Algorithm for k-MeansMakarychev K Makarychev Y Sviridenko M Ward J Jansen K Mathieu C Rolim JDP Umans C
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2016, September 7-9, 2016, Paris, France. vol. 60, 14:1-14:20.
01-01-2016
Submodular Stochastic Probing on MatroidsAdamczyk M Sviridenko M Ward J
Math. Oper. Res. vol. 41, 1022-1038.
01-01-2016
Maximizing k-Submodular Functions and BeyondWard J Zivny S
Acm Trans. Algorithms vol. 12, 47:1-47:26.
01-01-2016
2015
The Power of Randomization: Distributed Submodular Maximization on Massive DatasetsBarbosa RDP Ene A Nguyen HL Ward J Bach FR Blei DM
International Conference on Machine Learning Research Lille, France 7 Jul 2015 - 9 Jul 2015. vol. 37, 1236-1244.
01-07-2015
Optimal approximation for submodular and supermodular optimization with bounded curvatureSviridenko M Vondrák J Ward J Indyk P
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, San Diego, CA, USA, January 4-6, 2015., 1134-1148.
01-01-2015
2014
Monotone Submodular Maximization over a Matroid via Non-Oblivious Local SearchFilmus Y Ward J
Siam J. Comput. vol. 43, 514-542.
01-01-2014
Maximizing Bisubmodular and k-Submodular FunctionsWard J Zivny S Chekuri C
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014, Portland, Oregon, USA, January 5-7, 2014., 1468-1481.
01-01-2014
Submodular Stochastic Probing on MatroidsAdamczyk M Sviridenko M Ward J Mayr EW Portier N
31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), STACS 2014, March 5-8, 2014, Lyon, France. vol. 25, 29-40.
01-01-2014
2013
Large Neighborhood Local Search for the Maximum Set Packing ProblemSviridenko M Ward J Fomin FV Freivalds R Kwiatkowska MZ Peleg D
Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part I. vol. 7965, 792-803.
01-01-2013
2012
A Tight Combinatorial Algorithm for Submodular Maximization Subject to a Matroid ConstraintFilmus Y Ward J
53rd Annual IEEE Symposium on Foundations of Computer Science, FOCS 2012, New Brunswick, NJ, USA, October 20-23, 2012., 659-668.
01-01-2012
A (k+3)/2-approximation algorithm for monotone submodular k-set packing and general k-exchange systemsWard J Dürr C Wilke T
29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, February 29th - March 3rd, 2012, Paris, France. vol. 14, 42-53.
01-01-2012
The Power of Local Search: Maximum Coverage over a MatroidFilmus Y Ward J Dürr C Wilke T
29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, February 29th - March 3rd, 2012, Paris, France. vol. 14, 601-612.
01-01-2012
2011
Improved Approximations for k-Exchange Systems - (Extended Abstract)Feldman M Naor J Schwartz R Ward J Demetrescu C Halldórsson MM
Algorithms - ESA 2011 - 19th Annual European Symposium, Saarbrücken, Germany, September 5-9, 2011. Proceedings. vol. 6942, 784-798.
01-01-2011
2005
Prufrock: a framework for constructing polytypic theorem proversWard J Kimmell G Alexander P Redmiles DF Ellman T Zisman A
20th IEEE/ACM International Conference on Automated Software Engineering (ASE 2005), November 7-11, 2005, Long Beach, CA, USA., 423-426.
01-01-2005
Better Guarantees for k-Means and Euclidean k-Median by Primal-Dual AlgorithmsAhmadian S Norouzi-Fard A Svensson O WARD JD
FOCS '17.
Submodular Maximization beyond Non-negativity: Guarantees, Fast Algorithms, and ApplicationsHarshaw C Feldman M Ward J Karbasi A
Proceedings of the 36th International Conference on Machine Learning (ICML '19) Long Beach, CA, USA. vol. 97, 2634-2643.
An Improved Approximation for Maximum Weighted k-Set PackingThiery T Ward J
ACM-SIAM Symposium on Discrete Algorithms Florence, Italy.
Grants
Grants of specific relevance to the Centre for Combinatorics, Algebra and Number TheoryEPSRC New Investigator Award - Dr Justin WardJustin Ward
£121,643 EPSRC Engineering and Physical Sciences Research Council
01-09-2019 - 31-08-2022
Research Group
News
No news items found.