4 citations · 4 across the 5 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2021
On the Geometry of Stable Steiner Tree Instances
James Freitag, Neshat Mohammadi, Aditya Potukuchi +1
In this note we consider the Steiner tree problem under Bilu-Linial stability. We give strong geometric structural properties that need to be satisfied by stable instances. We then…
cs.DS2021
Approximately counting independent sets in bipartite graphs via graph containers
Matthew Jenssen, Will Perkins, Aditya Potukuchi
By implementing algorithmic versions of Sapozhenko's graph container methods, we give new algorithms for approximating the number of independent sets in bipartite graphs. Our first…