Papers
Communities
Events
Blog
Pricing
Search
Open menu
Home
Papers
2206.13211
Cited By
Modern graph neural networks do worse than classical greedy algorithms in solving combinatorial optimization problems like maximum independent set
27 June 2022
Maria Chiara Angelini
F. Ricci-Tersenghi
GNN
AI4CE
Re-assign community
ArXiv
PDF
HTML
Papers citing
"Modern graph neural networks do worse than classical greedy algorithms in solving combinatorial optimization problems like maximum independent set"
4 / 4 papers shown
Title
Unrealized Expectations: Comparing AI Methods vs Classical Algorithms for Maximum Independent Set
Yikai Wu
Haoyu Zhao
Sanjeev Arora
82
0
0
05 Feb 2025
A Short Review on Novel Approaches for Maximum Clique Problem: from Classical algorithms to Graph Neural Networks and Quantum algorithms
Raffaele Marino
L. Buffoni
Bogdan Zavalnij
GNN
40
5
0
13 Mar 2024
Distributed Constrained Combinatorial Optimization leveraging Hypergraph Neural Networks
Nasimeh Heydaribeni
Xinrui Zhan
Ruisi Zhang
Tina Eliassi-Rad
F. Koushanfar
AI4CE
35
8
0
15 Nov 2023
Reply to: Modern graph neural networks do worse than classical greedy algorithms in solving combinatorial optimization problems like maximum independent set
M. Schuetz
J. K. Brubaker
H. Katzgraber
34
10
0
03 Feb 2023
1