Ameet Gadekar

According to our database, Ameet Gadekar authored at least 12 papers between 2015 and 2024.

Collaborative distances:

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

2024

Diversity-aware clustering: Computational Complexity and Approximation Algorithms.

Suhas Thejaswi, Ameet Gadekar, Bruno Ordozgoiti, Aristides Gionis

CoRR, 2024

2023

Parameterized Approximation Results for Clustering and Graph Packing Problems.

Ameet Gadekar

PhD thesis, 2023

Parameterized Approximation for Robust Clustering in Discrete Geometric Spaces.

Fateme Abbasi, Sandip Banerjee, Jaroslaw Byrka, Parinya Chalermsook, Ameet Gadekar, Kamyar Khodamoradi, Dániel Marx, Roohani Sharma, Joachim Spoerhase

CoRR, 2023

Independent Set in k-Claw-Free Graphs: Conditional χ-Boundedness and the Power of LP/SDP Relaxations.

Parinya Chalermsook, Ameet Gadekar, Kamyar Khodamoradi, Joachim Spoerhase

Proceedings of the Approximation and Online Algorithms - 21st International Workshop, 2023

On the Parameterized Complexity of Compact Set Packing.

Ameet Gadekar

Proceedings of the WALCOM: Algorithms and Computation, 2023

Parameterized Approximation Schemes for Clustering with General Norm Objectives.

Fateme Abbasi, Sandip Banerjee, Jaroslaw Byrka, Parinya Chalermsook, Ameet Gadekar, Kamyar Khodamoradi, Dániel Marx, Roohani Sharma, Joachim Spoerhase

Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

2022

Clustering with Fair-Center Representation: Parameterized Approximation Algorithms and Heuristics.

Suhas Thejaswi, Ameet Gadekar, Bruno Ordozgoiti, Michal Osadnik

Proceedings of the KDD '22: The 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, Washington, DC, USA, August 14, 2022

2021

Approximation algorithms for k-median with lower-bound constraints.

Ameet Gadekar, Bruno Ordozgoiti, Suhas Thejaswi

CoRR, 2021

2020

Improved learning of <i>k</i>-parities.

Arnab Bhattacharyya, Ameet Gadekar, Ninad Rajgopal

Theor. Comput. Sci., 2020

2018

Improved Learning of k-Parities.

Arnab Bhattacharyya, Ameet Gadekar, Ninad Rajgopal

Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

2015

On the hardness of learning sparse parities.

Arnab Bhattacharyya, Ameet Gadekar, Suprovat Ghoshal, Rishi Saket

Electron. Colloquium Comput. Complex., 2015

On learning k-parities with and without noise.

Arnab Bhattacharyya, Ameet Gadekar, Ninad Rajgopal

CoRR, 2015