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
∙
08/27/2020
On the Approximability of the Traveling Salesman Problem with Line Neighborhoods
We study the variant of the Euclidean Traveling Salesman problem where i...
research
∙
07/15/2020
Vertex Sparsification for Edge Connectivity
Graph compression or sparsification is a basic information-theoretic and...
research
∙
10/23/2019
Mimicking Networks Parameterized by Connectivity
Given a graph G=(V,E), capacities w(e) on edges, and a subset of termina...
research
∙
02/28/2018