default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThomas W. Pensyl
- > Home > Persons > Thomas W. Pensyl
Publications
- 2023
[c6]Kishen N. Gowda, Thomas W. Pensyl, Aravind Srinivasan, Khoa Trinh:
Improved Bi-point Rounding Algorithms and a Golden Barrier for k-Median. SODA 2023: 987-1011- 2022
- [j6]David G. Harris, Thomas W. Pensyl, Aravind Srinivasan, Khoa Trinh:
Dependent randomized rounding for clustering and partition systems with knapsack constraints. J. Mach. Learn. Res. 23: 81:1-81:41 (2022) - [i5]Kishen N. Gowda, Thomas W. Pensyl, Aravind Srinivasan, Khoa Trinh:
Improved Bi-point Rounding Algorithms and a Golden Barrier for k-Median. CoRR abs/2210.13395 (2022) - 2020
- [c5]David G. Harris, Thomas W. Pensyl, Aravind Srinivasan, Khoa Trinh:
Dependent randomized rounding for clustering and partition systems with knapsack constraints. AISTATS 2020: 2273-2283 - 2019
- [j5]David G. Harris, Shi Li, Thomas W. Pensyl, Aravind Srinivasan, Khoa Trinh:
Approximation Algorithms for Stochastic Clustering. J. Mach. Learn. Res. 20: 153:1-153:33 (2019) - [j4]David G. Harris, Thomas W. Pensyl, Aravind Srinivasan, Khoa Trinh:
A Lottery Model for Center-Type Problems With Outliers. ACM Trans. Algorithms 15(3): 36:1-36:25 (2019) - 2018
- [j3]Jaroslaw Byrka
, Thomas W. Pensyl, Bartosz Rybicki, Joachim Spoerhase, Aravind Srinivasan, Khoa Trinh:
An Improved Approximation Algorithm for Knapsack Median Using Sparsification. Algorithmica 80(4): 1093-1114 (2018) - [c4]David G. Harris, Shi Li, Aravind Srinivasan, Khoa Trinh, Thomas W. Pensyl:
Approximation algorithms for stochastic clustering. NeurIPS 2018: 6041-6050 - [i4]David G. Harris, Shi Li, Thomas W. Pensyl, Aravind Srinivasan, Khoa Trinh:
Approximation algorithms for stochastic clustering. CoRR abs/1809.02271 (2018) - 2017
- [j2]Jaroslaw Byrka, Thomas W. Pensyl, Bartosz Rybicki, Aravind Srinivasan, Khoa Trinh:
An Improved Approximation for k-Median and Positive Correlation in Budgeted Optimization. ACM Trans. Algorithms 13(2): 23:1-23:31 (2017) - [c3]David G. Harris, Thomas W. Pensyl, Aravind Srinivasan, Khoa Trinh:
A Lottery Model for Center-Type Problems with Outliers. APPROX-RANDOM 2017: 10:1-10:19 - [i3]David G. Harris, Thomas W. Pensyl, Aravind Srinivasan, Khoa Trinh:
Symmetric Randomized Dependent Rounding. CoRR abs/1709.06995 (2017) - [i2]David G. Harris, Thomas W. Pensyl, Aravind Srinivasan, Khoa Trinh:
A Lottery Model for Center-type Problems With Outliers. CoRR abs/1710.00287 (2017) - 2015
- [c2]Jaroslaw Byrka, Thomas W. Pensyl, Bartosz Rybicki, Joachim Spoerhase, Aravind Srinivasan, Khoa Trinh:
An Improved Approximation Algorithm for Knapsack Median Using Sparsification. ESA 2015: 275-287 - [c1]Jaroslaw Byrka, Thomas W. Pensyl, Bartosz Rybicki, Aravind Srinivasan, Khoa Trinh:
An Improved Approximation for k-median, and Positive Correlation in Budgeted Optimization. SODA 2015: 737-756 - 2014
- [i1]Jaroslaw Byrka, Thomas W. Pensyl, Bartosz Rybicki, Aravind Srinivasan, Khoa Trinh:
An Improved Approximation for $k$-median, and Positive Correlation in Budgeted Optimization. CoRR abs/1406.2951 (2014)
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 2025-08-27 20:37 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:
