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 cs.DSShow all

7 papers · 1 filter

cs.DS2025

Hedgegraph Polymatroids

Karthekeyan Chandrasekaran, Chandra Chekuri, Weihang Wang +1

Graphs and hypergraphs combine expressive modeling power with algorithmic efficiency for a wide range of applications. Hedgegraphs generalize hypergraphs further by grouping hypere…

cs.DS2023

Approximating submodular $k$ -partition via principal partition sequence

Karthekeyan Chandrasekaran, Weihang Wang

In submodular $k$ -partition, the input is a non-negative submodular function $f$ defined over a finite ground set $V$ (given by an evaluation oracle) along with a positive integer…

cs.DS2022

Approximate minimum cuts and their enumeration

Calvin Beideman, Karthekeyan Chandrasekaran, Weihang Wang

We show that every $α$ -approximate minimum cut in a connected graph is the unique minimum $(S, T)$ -terminal cut for some subsets $S$ and $T$ of vertices each of size at most $\lfloo…

cs.DS2022

Counting and enumerating optimum cut sets for hypergraph $k$ -partitioning problems for fixed $k$

Calvin Beideman, Karthekeyan Chandrasekaran, Weihang Wang

We consider the problem of enumerating optimal solutions for two hypergraph $k$ -partitioning problems -- namely, Hypergraph- $k$ -Cut and Minmax-Hypergraph- $k$ -Partition. The input i…

cs.DS2021★ 1 cited

Deterministic enumeration of all minimum cut-sets and $k$ -cut-sets in hypergraphs for fixed $k$

Calvin Beideman, Karthekeyan Chandrasekaran, Weihang Wang

We consider the problem of deterministically enumerating all minimum $k$ -cut-sets in a given hypergraph for any fixed $k$ . The input here is a hypergraph $G = (V, E)$ with non-nega…

cs.DS2021

$ℓ_{p}$ -norm Multiway Cut

Karthekeyan Chandrasekaran, Weihang Wang

We introduce and study $ℓ_{p}$ -norm-multiway-cut: the input here is an undirected graph with non-negative edge weights along with $k$ terminals and the goal is to find a partition…

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…

Hedgegraph Polymatroids

Approximating submodular k-partition via principal partition sequence

Approximate minimum cuts and their enumeration

Counting and enumerating optimum cut sets for hypergraph k-partitioning problems for fixed k

Deterministic enumeration of all minimum cut-sets and k-cut-sets in hypergraphs for fixed k

ℓp​-norm Multiway Cut

Fixed Parameter Approximation Scheme for Min-max k-cut

Approximating submodular $k$ -partition via principal partition sequence

Counting and enumerating optimum cut sets for hypergraph $k$ -partitioning problems for fixed $k$

Deterministic enumeration of all minimum cut-sets and $k$ -cut-sets in hypergraphs for fixed $k$

$ℓ_{p}$ -norm Multiway Cut

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