Search Results - "Raychaudhury, Rahul"

Fair Set Cover by Dehghankar, Mohsen, Raychaudhury, Rahul, Sintos, Stavros, Asudeh, Abolfazl

“…The potential harms of algorithmic decisions have ignited algorithmic fairness as a central topic in computer science. One of the fundamental problems in…”
Get full text

Computing Data Distribution from Query Selectivities by Agarwal, Pankaj K, Raychaudhury, Rahul, Sintos, Stavros, Yang, Jun

“…ICDT 2024 We are given a set $\mathcal{Z}=\{(R_1,s_1),\ldots, (R_n,s_n)\}$, where each $R_i$ is a \emph{range} in $\Re^d$, such as rectangle or ball, and $s_i…”
Get full text

Fast Approximation Algorithms for Piercing Boxes by Points by Agarwal, Pankaj K, Har-Peled, Sariel, Raychaudhury, Rahul, Sintos, Stavros

“…$ \newcommand{\Re}{\mathbb{R}} \newcommand{\BX}{\mathcal{B}} \newcommand{\bb}{\mathsf{b}} \newcommand{\eps}{\varepsilon}…”
Get full text

Tolerant Bipartiteness Testing in Dense Graphs by Ghosh, Arijit, Mishra, Gopinath, Raychaudhury, Rahul, Sen, Sayantan

“…Bipartite testing has been a central problem in the area of property testing since its inception in the seminal work of Goldreich, Goldwasser and Ron [FOCS'96…”
Get full text

A Faster Algorithm for Max Cut in Dense Graphs by Ghosh, Arijit, Mishra, Gopinath, Raychaudhury, Rahul, Sen, Sayantan

“…We design an algorithm for approximating the size of \emph{Max Cut} in dense graphs. Given a proximity parameter $\varepsilon \in (0,1)$, our algorithm…”
Get full text

Approximation Algorithms for Partially Colorable Graphs by Ghoshal, Suprovat, Louis, Anand, Raychaudhury, Rahul

“…Graph coloring problems are a central topic of study in the theory of algorithms. We study the problem of partially coloring partially colorable graphs. For…”
Get full text