Modern graph neural networks do worse than classical greedy algorithms in solving combinatorial optimization problems like maximum independent set (Q6403234)
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: Modern graph neural networks do worse than classical greedy algorithms in solving combinatorial optimization problems like maximum independent set |
preprint article from arXiv
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Modern graph neural networks do worse than classical greedy algorithms in solving combinatorial optimization problems like maximum independent set |
preprint article from arXiv |
Statements
27 June 2022
0 references
cs.LG
0 references
cond-mat.dis-nn
0 references
cs.AI
0 references
math.OC
0 references
Maria Chiara Angelini
0 references
Federico Ricci-Tersenghi
0 references
