Agentic Algorithm Engineering: Improving Shared-Memory Exact Minimum Cuts
This work improves the minimum cut problem for an undirected edge-weighted graph using agentic algorithm engineering (AAE), a methodology that is available in the open-source package VieCut and has outperformed the previously fastest solvers by a factor of up to 2.5 sequentially and up to 12.9 when run in parallel.