3 citations · 5 across the 12 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.DS2019★ 3 cited
A Constant Approximation for Colorful k-Center
Sayan Bandyapadhyay, Tanmay Inamdar, Shreyas Pai +1
In this paper, we consider the colorful -center problem, which is a generalization of the well-known -center problem. Here, we are given red and blue points in a metric space…
cs.DC2019
Connectivity Lower Bounds in Broadcast Congested Clique
Shreyas Pai, Sriram V. Pemmaraju
We prove three new lower bounds for graph connectivity in the -bit broadcast congested clique model, BCC. First, in the KT- version of BCC, in which nodes are aware…