7 citations · 24 across the 16 of their papers we have counts for
5 papers · 1 filter
Non-Adaptive Edge Counting and Sampling via Bipartite Independent Set Queries
Raghavendra Addanki, Andrew McGregor, Cameron Musco
We study the problem of estimating the number of edges in an -vertex graph, accessed via the Bipartite Independent Set query model introduced by Beame et al. (ITCS '18). In this…
Improved Approximation and Scalability for Fair Max-Min Diversification
Raghavendra Addanki, Andrew McGregor, Alexandra Meliou +1
Given an -point metric space where each point belongs to one of different categories or groups and a set of integers , the fair Max-…
How to Design Robust Algorithms using Noisy Comparison Oracle
Raghavendra Addanki, Sainyam Galhotra, Barna Saha
Metric based comparison operations such as finding maximum, nearest and farthest neighbor are fundamental to studying various clustering techniques such as -center clustering an…
Intervention Efficient Algorithms for Approximate Learning of Causal Graphs
Raghavendra Addanki, Andrew McGregor, Cameron Musco
We study the problem of learning the causal relationships between a set of observed variables in the presence of latents, while minimizing the cost of interventions on the observed…
Dynamic Set Cover: Improved Algorithms & Lower Bounds
Amir Abboud, Raghavendra Addanki, Fabrizio Grandoni +2
We give new upper and lower bounds for the {\em dynamic} set cover problem. First, we give a -approximation for fully dynamic set cover in (amortized)…