3 citations · 6 across the 4 of their papers we have counts for
5 papers
Nearly-Tight Bounds for Flow Sparsifiers in Quasi-Bipartite Graphs
Syamantak Das, Nikhil Kumar, Daniel Vaz
Flow sparsification is a classic graph compression technique which, given a capacitated graph on terminals, aims to construct another capacitated graph , called a flow s…
Vertex Sparsification for Edge Connectivity
Parinya Chalermsook, Syamantak Das, Bundit Laekhanukit +5
Graph compression or sparsification is a basic information-theoretic and computational question. A major open problem in this research area is whether -approximate cut-prese…
Mimicking Networks Parameterized by Connectivity
Parinya Chalermsook, Syamantak Das, Bundit Laekhanukit +1
Given a graph , capacities on edges, and a subset of terminals , a mimicking network for is a graph $(…
A Constant Factor Approximation for Capacitated Min-Max Tree Cover
Syamantak Das, Lavina Jain, Nikhil Kumar
Given a graph with non-negative real edge lengths and an integer parameter , the Min-Max k-Tree Cover problem seeks to find a set of at most subtrees of , such…
Survivable Network Design for Group Connectivity in Low-Treewidth Graphs
Parinya Chalermsook, Syamantak Das, Guy Even +2
In the Group Steiner Tree problem (GST), we are given a (vertex or edge)-weighted graph on vertices, a root vertex and a collection of groups $\{S_i\}_{i\in[h]}:…