Justin Ward

40 papers A* 10A 4Journal 22Unranked 3
YearRankTypeTitle / Venue / Authors
2026 J jnl
Submodular Maximization over a Matroid
CoRR
Moran Feldman, Justin Ward
2023 A* conf
An Improved Approximation for Maximum Weighted
SODA
Theophile Thiery, Justin Ward
2023 J jnl
An Improved Approximation for Maximum Weighted k-Set Packing.
CoRR
Theophile Thiery, Justin Ward
2023 J jnl
FPT-Algorithms for the \(\ell\) -Matchoid Problem with a Coverage Objective.
SIAM J. Discret. Math.
Chien-Chung Huang, Justin Ward
2022 A* conf
Two-Sided Weak Submodularity for Matroid Constrained Optimization and Regression.
COLT
Theophile Thiery, Justin Ward
2021 J jnl
Improved Multi-Pass Streaming Algorithms for Submodular Maximization with Matroid Constraints.
CoRR
Chien-Chung Huang, Theophile Thiery, Justin Ward
2021 J jnl
Two-Sided Weak Submodularity for Matroid Constrained Optimization and Regression.
CoRR
Theophile Thiery, Justin Ward
2020 J jnl
Better Guarantees for k-Means and Euclidean k-Median by Primal-Dual Algorithms.
SIAM J. Comput.
Sara Ahmadian, Ashkan Norouzi-Fard, Ola Svensson, Justin Ward
2020 J jnl
FPT-Algorithms for the l-Matchoid Problem with Linear and Submodular Objectives.
CoRR
Chien-Chung Huang, Justin Ward
2020 — conf
Improved Multi-Pass Streaming Algorithms for Submodular Maximization with Matroid Constraints.
APPROX-RANDOM
Chien-Chung Huang, Theophile Thiery, Justin Ward
2019 J jnl
Submodular Maximization Beyond Non-negativity: Guarantees, Fast Algorithms, and Applications.
CoRR
Christopher Harshaw, Moran Feldman, Justin Ward, Amin Karbasi
2019 A* conf
Submodular Maximization beyond Non-negativity: Guarantees, Fast Algorithms, and Applications.
ICML
Chris Harshaw, Moran Feldman, Justin Ward, Amin Karbasi
2017 A* conf
Better Guarantees for k-Means and Euclidean k-Median by Primal-Dual Algorithms.
FOCS
Sara Ahmadian, Ashkan Norouzi-Fard, Ola Svensson, Justin Ward
2017 J jnl
Optimal Approximation for Submodular and Supermodular Optimization with Bounded Curvature.
Math. Oper. Res.
Maxim Sviridenko, Jan Vondrák, Justin Ward
2016 — conf
A Bi-Criteria Approximation Algorithm for k-Means.
APPROX-RANDOM
Konstantin Makarychev, Yury Makarychev, Maxim Sviridenko, Justin Ward
2016 A* conf
A New Framework for Distributed Submodular Maximization.
FOCS
Rafael da Ponte Barbosa, Alina Ene, Huy L. Nguyen, Justin Ward
2016 J jnl
Better Guarantees for k-Means and Euclidean k-Median by Primal-Dual Algorithms.
CoRR
Sara Ahmadian, Ashkan Norouzi-Fard, Ola Svensson, Justin Ward
2016 J jnl
Maximizing
ACM Trans. Algorithms
Justin Ward, Stanislav Zivný
2016 J jnl
Submodular Stochastic Probing on Matroids.
Math. Oper. Res.
Marek Adamczyk, Maxim Sviridenko, Justin Ward
2015 J jnl
A New Framework for Distributed Submodular Maximization.
CoRR
Rafael da Ponte Barbosa, Alina Ene, Huy L. Nguyen, Justin Ward
2015 J jnl
A bi-criteria approximation algorithm for k Means.
CoRR
Konstantin Makarychev, Yury Makarychev, Maxim Sviridenko, Justin Ward
2015 A* conf
Optimal approximation for submodular and supermodular optimization with bounded curvature.
SODA
Maxim Sviridenko, Jan Vondrák, Justin Ward
2015 A* conf
The Power of Randomization: Distributed Submodular Maximization on Massive Datasets.
ICML
Rafael da Ponte Barbosa, Alina Ene, Huy L. Nguyen, Justin Ward
2015 J jnl
The Power of Randomization: Distributed Submodular Maximization on Massive Datasets.
CoRR
Rafael da Ponte Barbosa, Alina Ene, Huy L. Nguyen, Justin Ward
2014 A* conf
Maximizing Bisubmodular and
SODA
Justin Ward, Stanislav Zivný
2014 J jnl
Maximizing k-Submodular Functions and Beyond.
CoRR
Justin Ward, Stanislav Zivný
2014 J jnl
Monotone Submodular Maximization over a Matroid via Non-Oblivious Local Search.
SIAM J. Comput.
Yuval Filmus, Justin Ward
2014 A conf
Submodular Stochastic Probing on Matroids.
STACS
Marek Adamczyk, Maxim Sviridenko, Justin Ward
2013 J jnl
Large Neighborhood Local Search for the Maximum Set Packing Problem
CoRR
Maxim Sviridenko, Justin Ward
2013 — conf
Large Neighborhood Local Search for the Maximum Set Packing Problem.
ICALP (1)
Maxim Sviridenko, Justin Ward
2013 — —
Oblivious and Non-oblivious Local Search for Combinatorial Optimization.
Justin Ward
2013 J jnl
Submodular Stochastic Probing on Matroids.
CoRR
Marek Adamczyk, Maxim Sviridenko, Justin Ward
2013 J jnl
Tight Bounds for Submodular and Supermodular Optimization with Bounded Curvature.
CoRR
Maxim Sviridenko, Justin Ward
2012 A conf
A (k+3)/2-approximation algorithm for monotone submodular k-set packing and general k-exchange systems.
STACS
Justin Ward
2012 J jnl
A Tight Combinatorial Algorithm for Submodular Maximization Subject to a Matroid Constraint
CoRR
Yuval Filmus, Justin Ward
2012 A* conf
A Tight Combinatorial Algorithm for Submodular Maximization Subject to a Matroid Constraint.
FOCS
Yuval Filmus, Justin Ward
2012 A conf
The Power of Local Search: Maximum Coverage over a Matroid.
STACS
Yuval Filmus, Justin Ward
2011 J jnl
A $(k + 3)/2$-approximation algorithm for monotone submodular maximization over a $k$-exchange system
CoRR
Justin Ward
2011 A conf
Improved Approximations for k-Exchange Systems - (Extended Abstract).
ESA
Moran Feldman, Joseph Naor, Roy Schwartz, Justin Ward
2005 A* conf
Prufrock: a framework for constructing polytypic theorem provers.
ASE
Justin Ward, Garrin Kimmell, Perry Alexander