2 citations · 2 across the 5 of their papers we have counts for
9 papers
Tight FPT Approximation for Constrained k-Center and k-Supplier
Dishant Goyal, Ragesh Jaiswal
In this work, we study a range of constrained versions of the -supplier and -center problems such as: capacitated, fault-tolerant, fair, etc. These problems fall under a broa…
Tight FPT Approximation for Socially Fair Clustering
Dishant Goyal, Ragesh Jaiswal
In this work, we study the socially fair -median/-means problem. We are given a set of points in a metric space with a distance function . There are…
FPT Approximation for Constrained Metric -Median/Means
Dishant Goyal, Ragesh Jaiswal, Amit Kumar
The Metric -median problem over a metric space is defined as follows: given a set of facility locations and a set $C \subseteq \math…
Multiplicative Rank-1 Approximation using Length-Squared Sampling
Ragesh Jaiswal, Amit Kumar
We show that the span of rows of any matrix sampled according to the length-squared distribution contains a rank-$1…
Streaming PTAS for Binary -Low Rank Approximation
Anup Bhattacharya, Dishant Goyal, Ragesh Jaiswal +1
We give a 3-pass, polylog-space streaming PTAS for the constrained binary -means problem and a 4-pass, polylog-space streaming PTAS for the binary -low rank approximatio…
Streaming PTAS for Constrained k-Means
Dishant Goyal, Ragesh Jaiswal, Amit Kumar
We generalise the results of Bhattacharya et al. (Journal of Computing Systems, 62(1):93-115, 2018) for the list--means problem defined as -- for a (unknown) partition $X_1, ...…