57 citations · 181 across the 23 of their papers we have counts for
4 papers · 1 filter
Near-Optimal Disjoint-Path Facility Location Through Set Cover by Pairs
David S. Johnson, Lee Breslau, Ilias Diakonikolas +6
In this paper we consider two special cases of the "cover-by-pairs" optimization problem that arise when we need to place facilities so that each customer is served by two faciliti…
Phase transitions of extremal cuts for the configuration model
Souvik Dhara, Debankur Mukherjee, Subhabrata Sen
The -section width and the Max-Cut for the configuration model are shown to exhibit phase transitions according to the values of certain parameters of the asymptotic degree dist…
Detection Thresholds for the -Model on Sparse Graphs
Rajarshi Mukherjee, Sumit Mukherjee, Subhabrata Sen
In this paper we study sharp thresholds for detecting sparse signals in -models for potentially sparse random graphs. The results demonstrate interesting interplay between graph…
Optimization on Sparse Random Hypergraphs and Spin Glasses
Subhabrata Sen
We establish that in the large degree limit, the value of certain optimization problems on sparse random hypergraphs is determined by an appropriate Gaussian optimization problem.…