research
∙
04/28/2022
Survivable Network Design Revisited: Group-Connectivity
In the classical survivable network design problem (SNDP), we are given ...
share
research
∙
02/26/2022
Almost Tight Approximation Hardness for Single-Source Directed k-Edge-Connectivity
In the k-connected directed Steiner tree problem (k-DST), we are given a...
research
∙
03/18/2019
Counting independent sets and colorings on random regular bipartite graphs
We give a fully polynomial-time approximation scheme (FPTAS) to count th...
research
∙
07/24/2018
Zeros of Holant problems: locations and algorithms
We present fully polynomial-time (deterministic or randomised) approxima...
research
∙
11/09/2017