Thomas W. Pensyl

According to our database, Thomas W. Pensyl authored at least 10 papers between 2012 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Improved Bi-point Rounding Algorithms and a Golden Barrier for <i>k</i>-Median.

Kishen N. Gowda, Thomas W. Pensyl, Aravind Srinivasan, Khoa Trinh

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

2022

Dependent randomized rounding for clustering and partition systems with knapsack constraints.

David G. Harris, Thomas W. Pensyl, Aravind Srinivasan, Khoa Trinh

J. Mach. Learn. Res., 2022

Improved Bi-point Rounding Algorithms and a Golden Barrier for k-Median.

Kishen N. Gowda, Thomas W. Pensyl, Aravind Srinivasan, Khoa Trinh

CoRR, 2022

2019

A Lottery Model for Center-Type Problems With Outliers.

David G. Harris, Thomas W. Pensyl, Aravind Srinivasan, Khoa Trinh

ACM Trans. Algorithms, 2019

Approximation Algorithms for Stochastic Clustering.

David G. Harris, Shi Li, Thomas W. Pensyl, Aravind Srinivasan, Khoa Trinh

J. Mach. Learn. Res., 2019

2018

An Improved Approximation Algorithm for Knapsack Median Using Sparsification.

Jaroslaw Byrka, Thomas W. Pensyl, Bartosz Rybicki, Joachim Spoerhase, Aravind Srinivasan, Khoa Trinh

Algorithmica, 2018

2017

An Improved Approximation for <i>k</i>-Median and Positive Correlation in Budgeted Optimization.

Jaroslaw Byrka, Thomas W. Pensyl, Bartosz Rybicki, Aravind Srinivasan, Khoa Trinh

ACM Trans. Algorithms, 2017

Symmetric Randomized Dependent Rounding.

David G. Harris, Thomas W. Pensyl, Aravind Srinivasan, Khoa Trinh

CoRR, 2017

2014

An Improved Approximation for $k$-median, and Positive Correlation in Budgeted Optimization.

Jaroslaw Byrka, Thomas W. Pensyl, Bartosz Rybicki, Aravind Srinivasan, Khoa Trinh

CoRR, 2014

2012

Lecture Hall Partitions and the Wreath Products Ck ≀ Sn.

Thomas W. Pensyl, Carla D. Savage

Integers, 2012