%0 Journal Article %1 journals/natmi/AngeliniR23 %A Angelini, Maria Chiara %A Ricci-Tersenghi, Federico %D 2023 %J Nat. Mac. Intell. %K dblp %N 1 %P 29-31 %T Modern graph neural networks do worse than classical greedy algorithms in solving combinatorial optimization problems like maximum independent set. %U http://dblp.uni-trier.de/db/journals/natmi/natmi5.html#AngeliniR23 %V 5

@article{journals/natmi/AngeliniR23, added-at = {2023-05-17T00:00:00.000+0200}, author = {Angelini, Maria Chiara and Ricci-Tersenghi, Federico}, biburl = {https://www.bibsonomy.org/bibtex/27e5417896624446b6ea17a6854979bdc/dblp}, ee = {https://doi.org/10.1038/s42256-022-00589-y}, interhash = {833363ba35c2b321df36795b113e21e7}, intrahash = {7e5417896624446b6ea17a6854979bdc}, journal = {Nat. Mac. Intell.}, keywords = {dblp}, month = {January}, number = 1, pages = {29-31}, timestamp = {2024-04-08T20:50:52.000+0200}, title = {Modern graph neural networks do worse than classical greedy algorithms in solving combinatorial optimization problems like maximum independent set.}, url = {http://dblp.uni-trier.de/db/journals/natmi/natmi5.html#AngeliniR23}, volume = 5, year = 2023 }