26 citations · 35 across the 8 of their papers we have counts for
Showing cs.AIShow all
2 papers · 1 filter
cs.AI2026
Agentic Algorithm Engineering: Improving Shared-Memory Exact Minimum Cuts
David A. Bader, Adil Chhabra, Ernestine Großmann +3
The minimum cut problem for an undirected edge-weighted graph asks us to divide its set of nodes into two blocks while minimizing the weighted sum of the cut edges. Over the last y…
cs.AI2022★ 8 cited
A Metaheuristic Algorithm for Large Maximum Weight Independent Set Problems
Yuanyuan Dong, Andrew V. Goldberg, Alexander Noe +3
Motivated by a real-world vehicle routing application, we consider the maximum-weight independent set problem: Given a node-weighted graph, find a set of independent (mutually nona…