Justin Ward

According to our database1, Justin Ward authored at least 26 papers between 2005 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
FPT-Algorithms for the \(\ell\) -Matchoid Problem with a Coverage Objective.
SIAM J. Discret. Math., June, 2023

An Improved Approximation for Maximum Weighted k-Set Packing.
CoRR, 2023

An Improved Approximation for Maximum Weighted <i>k</i>-Set Packing.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

2022
Two-Sided Weak Submodularity for Matroid Constrained Optimization and Regression.
Proceedings of the Conference on Learning Theory, 2-5 July 2022, London, UK., 2022

2020
Better Guarantees for k-Means and Euclidean k-Median by Primal-Dual Algorithms.
SIAM J. Comput., 2020

FPT-Algorithms for the l-Matchoid Problem with Linear and Submodular Objectives.
CoRR, 2020

Improved Multi-Pass Streaming Algorithms for Submodular Maximization with Matroid Constraints.
Proceedings of the Approximation, 2020

2019
Submodular Maximization beyond Non-negativity: Guarantees, Fast Algorithms, and Applications.
Proceedings of the 36th International Conference on Machine Learning, 2019

2017
Optimal Approximation for Submodular and Supermodular Optimization with Bounded Curvature.
Math. Oper. Res., 2017

2016
Maximizing <i>k</i>-Submodular Functions and Beyond.
ACM Trans. Algorithms, 2016

Submodular Stochastic Probing on Matroids.
Math. Oper. Res., 2016

A New Framework for Distributed Submodular Maximization.
Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016

A Bi-Criteria Approximation Algorithm for k-Means.
Proceedings of the Approximation, 2016

2015
The Power of Randomization: Distributed Submodular Maximization on Massive Datasets.
Proceedings of the 32nd International Conference on Machine Learning, 2015

2014
Monotone Submodular Maximization over a Matroid via Non-Oblivious Local Search.
SIAM J. Comput., 2014

Maximizing k-Submodular Functions and Beyond.
CoRR, 2014

Maximizing Bisubmodular and <i>k</i>-Submodular Functions.
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

2013
Oblivious and Non-oblivious Local Search for Combinatorial Optimization.
PhD thesis, 2013

Tight Bounds for Submodular and Supermodular Optimization with Bounded Curvature.
CoRR, 2013

Large Neighborhood Local Search for the Maximum Set Packing Problem.
Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

2012
A (k+3)/2-approximation algorithm for monotone submodular k-set packing and general k-exchange systems.
Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, 2012

The Power of Local Search: Maximum Coverage over a Matroid.
Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, 2012

A Tight Combinatorial Algorithm for Submodular Maximization Subject to a Matroid Constraint.
Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, 2012

2011
A $(k + 3)/2$-approximation algorithm for monotone submodular maximization over a $k$-exchange system
CoRR, 2011

Improved Approximations for k-Exchange Systems - (Extended Abstract).
Proceedings of the Algorithms - ESA 2011, 2011

2005
Prufrock: a framework for constructing polytypic theorem provers.
Proceedings of the 20th IEEE/ACM International Conference on Automated Software Engineering (ASE 2005), 2005


  Loading...