most citedReply to: Modern graph neural networks do worse than classical greedy algorithms in solving combinatorial optimization problems like maximum independent set

4 citations · 5 across the 2 of their papers we have counts for

collaborators

2 papers

cs.LG2023★ 1 cited

Reply to: Inability of a graph neural network heuristic to outperform greedy algorithms in solving combinatorial optimization problems

Martin J. A. Schuetz, J. Kyle Brubaker, Helmut G. Katzgraber

We provide a comprehensive reply to the comment written by Stefan Boettcher [arXiv:2210.00623] and argue that the comment singles out one particular non-representative example prob…

cond-mat.dis-nn2023★ 4 cited

Reply to: Modern graph neural networks do worse than classical greedy algorithms in solving combinatorial optimization problems like maximum independent set

Martin J. A. Schuetz, J. Kyle Brubaker, Helmut G. Katzgraber

We provide a comprehensive reply to the comment written by Chiara Angelini and Federico Ricci-Tersenghi [arXiv:2206.13211] and argue that the comment singles out one particular non…