1 citations · 1 across the 3 of their papers we have counts for
3 papers
Packing Compact Subgraphs with Applications to Districting
Ho-Lin Chen, Po-Yu Chou, Prathamesh Dharangutte +3
Packing disjoint subgraphs in a given graph is a fundamental problem with many applications. Motivated by political districting, we focus on connected subgraphs that are compact (e…
Hardness and Approximation Algorithms for Balanced Districting Problems
Prathamesh Dharangutte, Jie Gao, Shang-En Huang +1
We introduce and study the problem of balanced districting, where given an undirected graph with vertices carrying two types of weights (different population, resource types, etc)…
Differentially Private Range Queries with Correlated Input Perturbation
Prathamesh Dharangutte, Jie Gao, Ruobin Gong +1
This work proposes a class of differentially private mechanisms for linear queries, in particular range queries, that leverages correlated input perturbation to simultaneously achi…