Classical solver KaMIS outperforms leading AI methods for Maximum Independent Set on random graphs, with some AI approaches no better than simple greedy heuristics and a new serialization analysis revealing similar reasoning.
Combinatorial optimization with graph convolu- tional networks and guided tree search
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
Multipartite GNN learns MILP formulations of network interdiction to outperform baselines on bi-level combinatorial tasks.
citing papers explorer
-
Unrealized Expectations: Comparing AI Methods vs Classical Algorithms for Maximum Independent Set
Classical solver KaMIS outperforms leading AI methods for Maximum Independent Set on random graphs, with some AI approaches no better than simple greedy heuristics and a new serialization analysis revealing similar reasoning.
-
Network Interdiction Goes Neural
Multipartite GNN learns MILP formulations of network interdiction to outperform baselines on bi-level combinatorial tasks.