共 7 条
- [1] Reply to: Modern graph neural networks do worse than classical greedy algorithms in solving combinatorial optimization problems like maximum independent set[J]. NATURE MACHINE INTELLIGENCE, 2023, 5 (01) : 32 - 34Schuetz, Martin J. A.Brubaker, J. KyleKatzgraber, Helmut G.
- [2] Modern graph neural networks do worse than classical greedy algorithms in solving combinatorial optimization problems like maximum independent set[J]. NATURE MACHINE INTELLIGENCE, 2023, 5 (01) : 29 - 31Angelini, Maria ChiaraRicci-Tersenghi, Federico
- [3] Modern graph neural networks do worse than classical greedy algorithms in solving combinatorial optimization problems like maximum independent set[J]. Nature Machine Intelligence, 2023, 5 : 29 - 31Maria Chiara AngeliniFederico Ricci-Tersenghi
- [4] Reply to: Inability of a graph neural network heuristic to outperform greedy algorithms in solving combinatorial optimization problems[J]. Nature Machine Intelligence, 2023, 5 : 26 - 28Martin J. A. SchuetzJ. Kyle BrubakerHelmut G. Katzgraber
- [5] Reply to: Inability of a graph neural network heuristic to outperform greedy algorithms in solving combinatorial optimization problems[J]. NATURE MACHINE INTELLIGENCE, 2023, 5 (01) : 26 - 28Schuetz, Martin J. A.Brubaker, J. KyleKatzgraber, Helmut G.
- [6] Inability of a graph neural network heuristic to outperform greedy algorithms in solving combinatorial optimization problems[J]. Nature Machine Intelligence, 2023, 5 : 24 - 25Stefan Boettcher