default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJustin Ward
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j6]Chien-Chung Huang, Justin Ward:
FPT-Algorithms for the \(\ell\) -Matchoid Problem with a Coverage Objective. SIAM J. Discret. Math. 37(2): 1053-1078 (2023)- [c17]Theophile Thiery, Justin Ward:
An Improved Approximation for Maximum Weighted k-Set Packing. SODA 2023: 1138-1162 - [i15]Theophile Thiery, Justin Ward:
An Improved Approximation for Maximum Weighted k-Set Packing. CoRR abs/2301.07537 (2023) - 2022
- [c16]Theophile Thiery, Justin Ward:
Two-Sided Weak Submodularity for Matroid Constrained Optimization and Regression. COLT 2022: 3605-3634 - 2021
- [i14]Theophile Thiery, Justin Ward:
Two-Sided Weak Submodularity for Matroid Constrained Optimization and Regression. CoRR abs/2102.09644 (2021) - [i13]Chien-Chung Huang, Theophile Thiery, Justin Ward:
Improved Multi-Pass Streaming Algorithms for Submodular Maximization with Matroid Constraints. CoRR abs/2102.09679 (2021) - 2020
- [j5]Sara Ahmadian, Ashkan Norouzi-Fard, Ola Svensson, Justin Ward:
Better Guarantees for k-Means and Euclidean k-Median by Primal-Dual Algorithms. SIAM J. Comput. 49(4) (2020) - [c15]Chien-Chung Huang, Theophile Thiery, Justin Ward:
Improved Multi-Pass Streaming Algorithms for Submodular Maximization with Matroid Constraints. APPROX-RANDOM 2020: 62:1-62:19 - [i12]Chien-Chung Huang, Justin Ward:
FPT-Algorithms for the l-Matchoid Problem with Linear and Submodular Objectives. CoRR abs/2011.06268 (2020)
2010 – 2019
- 2019
- [c14]Chris Harshaw, Moran Feldman, Justin Ward, Amin Karbasi:
Submodular Maximization beyond Non-negativity: Guarantees, Fast Algorithms, and Applications. ICML 2019: 2634-2643 - [i11]Christopher Harshaw, Moran Feldman, Justin Ward, Amin Karbasi:
Submodular Maximization Beyond Non-negativity: Guarantees, Fast Algorithms, and Applications. CoRR abs/1904.09354 (2019) - 2017
- [j4]Maxim Sviridenko, Jan Vondrák, Justin Ward:
Optimal Approximation for Submodular and Supermodular Optimization with Bounded Curvature. Math. Oper. Res. 42(4): 1197-1218 (2017) - [c13]Sara Ahmadian, Ashkan Norouzi-Fard, Ola Svensson, Justin Ward:
Better Guarantees for k-Means and Euclidean k-Median by Primal-Dual Algorithms. FOCS 2017: 61-72 - 2016
- [j3]Marek Adamczyk, Maxim Sviridenko, Justin Ward:
Submodular Stochastic Probing on Matroids. Math. Oper. Res. 41(3): 1022-1038 (2016) - [j2]Justin Ward, Stanislav Zivný:
Maximizing k-Submodular Functions and Beyond. ACM Trans. Algorithms 12(4): 47:1-47:26 (2016) - [c12]Konstantin Makarychev, Yury Makarychev, Maxim Sviridenko, Justin Ward:
A Bi-Criteria Approximation Algorithm for k-Means. APPROX-RANDOM 2016: 14:1-14:20 - [c11]Rafael da Ponte Barbosa, Alina Ene, Huy L. Nguyen, Justin Ward:
A New Framework for Distributed Submodular Maximization. FOCS 2016: 645-654 - [i10]Sara Ahmadian, Ashkan Norouzi-Fard, Ola Svensson, Justin Ward:
Better Guarantees for k-Means and Euclidean k-Median by Primal-Dual Algorithms. CoRR abs/1612.07925 (2016) - 2015
- [c10]Rafael da Ponte Barbosa, Alina Ene, Huy L. Nguyen, Justin Ward:
The Power of Randomization: Distributed Submodular Maximization on Massive Datasets. ICML 2015: 1236-1244 - [c9]Maxim Sviridenko, Jan Vondrák, Justin Ward:
Optimal approximation for submodular and supermodular optimization with bounded curvature. SODA 2015: 1134-1148 - [i9]Rafael da Ponte Barbosa, Alina Ene, Huy L. Nguyen, Justin Ward:
The Power of Randomization: Distributed Submodular Maximization on Massive Datasets. CoRR abs/1502.02606 (2015) - [i8]Rafael da Ponte Barbosa, Alina Ene, Huy L. Nguyen, Justin Ward:
A New Framework for Distributed Submodular Maximization. CoRR abs/1507.03719 (2015) - [i7]Konstantin Makarychev, Yury Makarychev, Maxim Sviridenko, Justin Ward:
A bi-criteria approximation algorithm for k Means. CoRR abs/1507.04227 (2015) - 2014
- [j1]Yuval Filmus, Justin Ward:
Monotone Submodular Maximization over a Matroid via Non-Oblivious Local Search. SIAM J. Comput. 43(2): 514-542 (2014) - [c8]Justin Ward, Stanislav Zivný:
Maximizing Bisubmodular and k-Submodular Functions. SODA 2014: 1468-1481 - [c7]Marek Adamczyk, Maxim Sviridenko, Justin Ward:
Submodular Stochastic Probing on Matroids. STACS 2014: 29-40 - [i6]Justin Ward, Stanislav Zivný:
Maximizing k-Submodular Functions and Beyond. CoRR abs/1409.1399 (2014) - 2013
- [b1]Justin Ward:
Oblivious and Non-oblivious Local Search for Combinatorial Optimization. University of Toronto, Canada, 2013 - [c6]Maxim Sviridenko, Justin Ward:
Large Neighborhood Local Search for the Maximum Set Packing Problem. ICALP (1) 2013: 792-803 - [i5]Maxim Sviridenko, Justin Ward:
Large Neighborhood Local Search for the Maximum Set Packing Problem. CoRR abs/1302.4347 (2013) - [i4]Marek Adamczyk, Maxim Sviridenko, Justin Ward:
Submodular Stochastic Probing on Matroids. CoRR abs/1310.4415 (2013) - [i3]Maxim Sviridenko, Justin Ward:
Tight Bounds for Submodular and Supermodular Optimization with Bounded Curvature. CoRR abs/1311.4728 (2013) - 2012
- [c5]Yuval Filmus, Justin Ward:
A Tight Combinatorial Algorithm for Submodular Maximization Subject to a Matroid Constraint. FOCS 2012: 659-668 - [c4]Justin Ward:
A (k+3)/2-approximation algorithm for monotone submodular k-set packing and general k-exchange systems. STACS 2012: 42-53 - [c3]Yuval Filmus, Justin Ward:
The Power of Local Search: Maximum Coverage over a Matroid. STACS 2012: 601-612 - [i2]Yuval Filmus, Justin Ward:
A Tight Combinatorial Algorithm for Submodular Maximization Subject to a Matroid Constraint. CoRR abs/1204.4526 (2012) - 2011
- [c2]Moran Feldman
, Joseph Naor, Roy Schwartz, Justin Ward:
Improved Approximations for k-Exchange Systems - (Extended Abstract). ESA 2011: 784-798 - [i1]Justin Ward:
A $(k + 3)/2$-approximation algorithm for monotone submodular maximization over a $k$-exchange system. CoRR abs/1108.4983 (2011)
2000 – 2009
- 2005
- [c1]Justin Ward, Garrin Kimmell, Perry Alexander:
Prufrock: a framework for constructing polytypic theorem provers. ASE 2005: 423-426
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:35 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
