Weighted Min-Cut - Sequential, Cut-Query and Streaming Algorithms

Weighted Min-Cut - Sequential, Cut-Query and Streaming Algorithms

Explore cutting-edge algorithms for solving the weighted min-cut problem in this 20-minute conference talk presented at the Association for Computing Machinery (ACM). Delve into sequential, cut-query, and streaming algorithms, examining the state-of-the-art approaches in each model. Learn about the global mincut problem, 2-respecting cuts, and the matrix min-entry problem. Discover a novel schematic algorithm that works across different models, providing a unified approach to solving weighted min-cut problems. Gain insights into the implementation details for various scenarios and consider open problems in this field of study.