Browsing Division of Electrical, Electronics, and Computer Science (EECS) by Advisor "Louis, Anand"
Now showing items 1-3 of 3
-
Algorithms for Fair Clustering
Many decisions today are taken by various machine learning algorithms, hence it is crucial to accommodate fairness in such algorithms to remove/reduce any kind of bias in the decision. We incorporate fairness in the ... -
Recovery Algorithms for planted structures in Semi-random models
For many NP-hard problems, the analysis of best-known approximation algorithms yields “poor” worst-case guarantees. However, using various heuristics, the problems can be solved (to some extent) in real-life instances. ... -
Robust Algorithms for recovering planted structures in Semi-random instances
In this thesis, we study algorithms for three fundamental graph problems. These are NP-hard problems which have not been understood completely as there is a signifiicant gap between the algorithmic and the hardness fronts ...