Approximation Ratios of Graph Neural Networks for Combinatorial Problems.
Ryoma SatoMakoto YamadaHisashi KashimaPublished in: CoRR (2019)
Keyphrases
- combinatorial problems
- neural network
- constraint programming
- metaheuristic
- combinatorial optimization
- traveling salesman problem
- graph coloring
- constraint satisfaction problems
- constraint satisfaction
- solving hard
- branch and bound algorithm
- graph colouring
- phase transition
- specific problems
- hard combinatorial optimization problems
- artificial neural networks
- approximation algorithms
- search strategies
- graph matching
- weighted graph
- graph mining
- global constraints
- special case
- genetic algorithm
- branch and bound
- ant colony optimization
- search tree
- optimization problems
- sat encodings