Volgen
Weihang Wang
Weihang Wang
PhD, University of Illinois at Urbana-Champaign
Geverifieerd e-mailadres voor illinois.edu - Homepage
Titel
Geciteerd door
Geciteerd door
Jaar
Counting and Enumerating Optimum Cut Sets for Hypergraph k-Partitioning Problems for Fixed k
C Beideman, K Chandrasekaran, W Wang
Mathematics of Operations Research, 2023
82023
Deterministic enumeration of all minimum k-cut-sets in hypergraphs for fixed k
C Beideman, K Chandrasekaran, W Wang
Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022
72022
Fixed parameter approximation scheme for min-max k-cut
K Chandrasekaran, W Wang
Mathematical Programming 197 (2), 1093-1144, 2023
22023
-Norm Multiway Cut
K Chandrasekaran, W Wang
Algorithmica 84 (9), 2667-2701, 2022
22022
Approximate minimum cuts and their enumeration
C Beideman, K Chandrasekaran, W Wang
Symposium on Simplicity in Algorithms (SOSA), 36-41, 2023
12023
Deterministic enumeration of all minimum cut-sets and k-cut-sets in hypergraphs for fixed k
C Beideman, K Chandrasekaran, W Wang
Mathematical Programming, 1-39, 2023
2023
Het systeem kan de bewerking nu niet uitvoeren. Probeer het later opnieuw.
Artikelen 1–6