WWWeihang Wang
Weihang Wang
*This is an algorithmically generated author record based on publicly available information.
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Weihang Wang has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Karthekeyan Chandrasekaran
University of Illinois
5 shared publications - Calvin Beideman
University of Illinois Urbana-Champaign, Urbana, Illinois 61801
3 shared publications Karthekeyan Chandrasekaran
University of Illinois Urbana-Champaign
2 shared publications- Chandra Chekuri
University of Illinois, Urbana-Champaign, Urbana, USA
1 shared publication - Weihao Zhu
University of Illinois, Urbana-Champaign
1 shared publication
Latest Publications
- 13 June 2026
- Published by Springer Nature
- p. 331-345
Hedgegraph Polymatroids
- 1 November 2024
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Mathematics of Operations Research
- Vol. 49 (4) , 2579-2601
Counting and Enumerating Optimum Cut Sets for Hypergraph k-Partitioning Problems for Fixed k
- 1 November 2024
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Mathematics of Operations Research
- Vol. 49 (4) , 2579-2601
Counting and Enumerating Optimum Cut Sets for Hypergraph k-Partitioning Problems for Fixed k
- 12 September 2023
- Published by Springer Nature in Mathematical Programming
- Vol. 207 (1-2) , 329-367
Deterministic enumeration of all minimum cut-sets and k-cut-sets in hypergraphs for fixed k
- 12 September 2023
- Published by Springer Nature in Mathematical Programming
- Vol. 207 (1-2) , 329-367
Deterministic enumeration of all minimum cut-sets and k-cut-sets in hypergraphs for fixed k
- Open Access
Approximate minimum cuts and their enumeration
We show that every $\alpha$-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 $\lfloor2\alpha\rfloor+1$. This leads to an alternative proof that the number of $\alpha$-approximate minimum cuts in a $n$-vertex connected graph is $n^{O(\alpha)}$ and they can all be enumerated in deterministic polynomial time for constant $\alpha$.Open AccessApproximate minimum cuts and their enumeration
We show that every $\alpha$-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 $\lfloor2\alpha\rfloor+1$. This leads to an alternative proof that the number of $\alpha$-approximate minimum cuts in a $n$-vertex connected graph is $n^{O(\alpha)}$ and they can all be enumerated in deterministic polynomial time for constant $\alpha$. - 16 June 2022
- Published by Springer Nature in Mathematical Programming
- Vol. 197 (2) , 1093-1144
Fixed parameter approximation scheme for min-max k-cut
- 16 June 2022
- Published by Springer Nature in Mathematical Programming
- Vol. 197 (2) , 1093-1144
Fixed parameter approximation scheme for min-max k-cut
- 23 May 2022
- Published by Springer Nature in Algorithmica
- Vol. 84 (9) , 2667-2701
$\ell _p$-Norm Multiway Cut- 23 May 2022
- Published by Springer Nature in Algorithmica
- Vol. 84 (9) , 2667-2701
$\ell _p$-Norm Multiway Cut- 5 May 2021
- Published by Springer Nature
- p. 354-367
Fixed Parameter Approximation Scheme for Min-Max k-Cut
- 5 May 2021
- Published by Springer Nature
- p. 354-367
Fixed Parameter Approximation Scheme for Min-Max k-Cut