Showing cs.DSShow all
3 papers · 1 filter
cs.DS2026
Subexponential Parameterized Approximation for Group-Fair Euclidean -Center
Rudranarayan Kar, Diya Roy, Abhishek Sahu
Clustering is a basic tool for grouping data into meaningful classes, but in many applications the resulting clusters must also respect the fairness conditions among different grou…
cs.DS2026
Exploiting Graph Structure for Near-Optimal Broadcasting
Rudranarayan Kar, Praneet Kumar Patra, Diya Roy +1
Telephone broadcasting is a classical model for spreading information in a network. Given a connected graph with source vertex , each informed vertex may inform exactly…
cs.DS2025
Learning with Structure: Computing Consistent Subsets on Structurally-Regular Graphs
Aritra Banik, Mano Prakash Parthasarathi, Venkatesh Raman +2
The Minimum Consistent Subset (MCS) problem arises naturally in the context of supervised clustering and instance selection. In supervised clustering, one aims to infer a meaningfu…