Inability of a graph neural network heuristic to outperform greedy algorithms in solving combinatorial optimization problems like Max-Cut (Q6412664)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Inability of a graph neural network heuristic to outperform greedy algorithms in solving combinatorial optimization problems like Max-Cut |
preprint article from arXiv
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Inability of a graph neural network heuristic to outperform greedy algorithms in solving combinatorial optimization problems like Max-Cut |
preprint article from arXiv |
Statements
2 October 2022
0 references
cond-mat.dis-nn
0 references
cs.AI
0 references
cs.LG
0 references
math.OC
0 references
quant-ph
0 references
Stefan Boettcher
0 references
