Weihang Wang

activity

20202025

most citedDeterministic enumeration of all minimum cut-sets and

k

-cut-sets in hypergraphs for fixed

k

1 citations · 1 across the 4 of their papers we have counts for

collaborators

Showing 2020Show all

1 paper · 1 filter

cs.DS2020

Fixed Parameter Approximation Scheme for Min-max $k$ -cut

Karthekeyan Chandrasekaran, Weihang Wang

We consider the graph $k$ -partitioning problem under the min-max objective, termed as Minmax $k$ -cut. The input here is a graph $G = (V, E)$ with non-negative edge weights $w:E\righta…

Fixed Parameter Approximation Scheme for Min-max k-cut

Fixed Parameter Approximation Scheme for Min-max $k$ -cut