3 citations · 6 across the 4 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.DS2019★ 3 cited
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 $(…
cs.DS2019★ 2 cited
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…