research
∙
11/11/2021
Approximating Sparsest Cut in Low-Treewidth Graphs via Combinatorial Diameter
The fundamental sparsest cut problem takes as input a graph G together w...
share
research
∙
01/01/2020
Multi-transversals for Triangles and the Tuza's Conjecture
In this paper, we study a primal and dual relationship about triangles: ...
research
∙
12/02/2019
PTAS for Steiner Tree on Map Graphs
We study the Steiner tree problem on map graphs, which substantially gen...
research
∙
04/29/2018
A Tight Approximation for Submodular Maximization with Mixed Packing and Covering Constraints
Motivated by applications in machine learning, such as subset selection ...
research
∙
04/10/2018
