Ali Vakilian

CoRR, 2024

On Socially Fair Low-Rank Approximation and Column Subset Selection.

[BibT_eX]

[DOI]

CoRR, 2024

Sublinear Metric Steiner Tree via Improved Bounds for Set Cover.

[BibT_eX]

[DOI]

CoRR, 2024

Minimax Group Fairness in Strategic Classification.

[BibT_eX]

[DOI]

Emily Diana

Saeed Sharifi-Malvajerdi

CoRR, 2024

A Polynomial-Time Approximation for Pairwise Fair k-Median Clustering.

[BibT_eX]

[DOI]

CoRR, 2024

Bayesian Strategic Classification.

[BibT_eX]

[DOI]

Lee Cohen

Saeed Sharifi-Malvajerdi

Kevin Stangl

Juba Ziani

CoRR, 2024

Streaming Algorithms for Connectivity Augmentation.

[BibT_eX]

[DOI]

Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

Scalable Algorithms for Individual Preference Stable Clustering.

[BibT_eX]

[DOI]

Ron Mosenzon

Proceedings of the International Conference on Artificial Intelligence and Statistics, 2024

Learning-Based Algorithms for Graph Searching Problems.

[BibT_eX]

[DOI]

Adela Frances DePavia

Erasmo Tani

Proceedings of the International Conference on Artificial Intelligence and Statistics, 2024

2023

Approximating Red-Blue Set Cover.

[BibT_eX]

[DOI]

Eden Chlamtác

CoRR, 2023

Tight Bounds for Volumetric Spanners and Applications.

[BibT_eX]

[DOI]

Aditya Bhaskara

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Improved Frequency Estimation Algorithms with and without Predictions.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Constant Approximation for Individual Preference Stable Clustering.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Approximation Algorithms for Fair Range Clustering.

[BibT_eX]

[DOI]

Sèdjro Salomon Hotegni

Proceedings of the International Conference on Machine Learning, 2023

Sequential Strategic Screening.

[BibT_eX]

[DOI]

Lee Cohen

Saeed Sharifi-Malvajerdi

Kevin Stangl

Juba Ziani

Proceedings of the International Conference on Machine Learning, 2023

Learning the Positions in CountSketch.

[BibT_eX]

[DOI]

Proceedings of the Eleventh International Conference on Learning Representations, 2023

Approximating Red-Blue Set Cover and Minimum Monotone Satisfying Assignment.

[BibT_eX]

[DOI]

Eden Chlamtác

Proceedings of the Approximation, 2023

2022

Approximating Fair Clustering with Cascaded Norm Objectives.

[BibT_eX]

[DOI]

Eden Chlamtác

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

Faster Fundamental Graph Algorithms via Learned Predictions.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Machine Learning, 2022

Individual Preference Stability for Clustering.

[BibT_eX]

[DOI]

Saba Ahmadi

Pranjal Awasthi

Samir Khuller

Matthäus Kleindessner

Jamie Morgenstern

Pattara Sukprasert

Proceedings of the International Conference on Machine Learning, 2022

Fair Representation Clustering with Several Protected Classes.

[BibT_eX]

[DOI]

Zhen Dai

Proceedings of the FAccT '22: 2022 ACM Conference on Fairness, Accountability, and Transparency, Seoul, Republic of Korea, June 21, 2022

Multi Stage Screening: Enforcing Fairness and Maximizing Efficiency in a Pre-Existing Pipeline.

[BibT_eX]

[DOI]

Avrim Blum

Kevin Stangl

Proceedings of the FAccT '22: 2022 ACM Conference on Fairness, Accountability, and Transparency, Seoul, Republic of Korea, June 21, 2022

Improved Approximation Algorithms for Individually Fair Clustering.

[BibT_eX]

[DOI]

Mustafa Yalçiner

Proceedings of the International Conference on Artificial Intelligence and Statistics, 2022

2021

Node-weighted Network Design in Planar and Minor-closed Families of Graphs.

[BibT_eX]

[DOI]

Chandra Chekuri

ACM Trans. Algorithms, 2021

Learning Online Algorithms with Distributional Advice.

[BibT_eX]

[DOI]

Proceedings of the 38th International Conference on Machine Learning, 2021

Approximation Algorithms for Socially Fair Clustering.

[BibT_eX]

[DOI]

Proceedings of the Conference on Learning Theory, 2021

2020

On Learned Sketches for Randomized Numerical Linear Algebra.

[BibT_eX]

[DOI]

CoRR, 2020

Improved Local Computation Algorithm for Set Cover via Sparsification.

[BibT_eX]

[DOI]

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

Individual Fairness for k-Clustering.

[BibT_eX]

[DOI]

Proceedings of the 37th International Conference on Machine Learning, 2020

2019

(Learned) Frequency Estimation Algorithms under Zipfian Distribution.

[BibT_eX]

[DOI]

Anders Aamand

CoRR, 2019

Tight Trade-offs for the Maximum k-Coverage Problem in the General Streaming Model.

[BibT_eX]

[DOI]

Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2019

Learning-Based Low-Rank Approximations.

[BibT_eX]

[DOI]

Yang Yuan

Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Local Computation Algorithms for Spanners.

[BibT_eX]

[DOI]

Proceedings of the 10th Innovations in Theoretical Computer Science Conference, 2019

Scalable Fair Clustering.

[BibT_eX]

[DOI]

Proceedings of the 36th International Conference on Machine Learning, 2019

Learning-Based Frequency Estimation Algorithms.

[BibT_eX]

[DOI]

Proceedings of the 7th International Conference on Learning Representations, 2019

Structural Rounding: Approximation Algorithms for Graphs Near an Algorithmically Tractable Class.

[BibT_eX]

[DOI]

Proceedings of the 27th Annual European Symposium on Algorithms, 2019

Sample-Optimal Low-Rank Approximation of Distance Matrices.

[BibT_eX]

[DOI]

Proceedings of the Conference on Learning Theory, 2019

2018

Cost-effective conceptual design using taxonomies.

[BibT_eX]

[DOI]

Amir Nayyeri

VLDB J., 2018

Set Cover in Sub-linear Time.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

2017

Cost-Effective Conceptual Design Over Taxonomies.

[BibT_eX]

[DOI]

Amir Nayyeri

Proceedings of the 20th International Workshop on the Web and Databases, 2017

Fractional Set Cover in the Streaming Model.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2017

2016

Towards Tight Bounds for the Streaming Set Cover Problem.

[BibT_eX]

[DOI]

Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2016

2015

Cost-Effective Conceptual Design for Information Extraction.

[BibT_eX]

[DOI]

Marianne Winslett

ACM Trans. Database Syst., 2015

Towards Tight Bounds for the Streaming Set Cover Problem.

[BibT_eX]

[DOI]

CoRR, 2015

2014

On Streaming and Communication Complexity of the Set Cover Problem.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing - 28th International Symposium, 2014

Improved approximation algorithms for degree-bounded network design problems with node connectivity requirements.

[BibT_eX]

[DOI]

Proceedings of the Symposium on Theory of Computing, 2014

Which concepts are worth extracting?

[BibT_eX]

[DOI]

Marianne Winslett

Proceedings of the International Conference on Management of Data, 2014

2013

Improved Approximation Algorithms for Connected Domatic Partitions and Related Problems

[BibT_eX]

[DOI]

Nitish Korula

CoRR, 2013

2012

Prize-Collecting Survivable Network Design in Node-Weighted Graphs.

[BibT_eX]

[DOI]

Chandra Chekuri