Are Graph Neural Networks Optimal Approximation Algorithms?
Morris YauEric LuNikolaos KaraliasJessica XuStefanie JegelkaPublished in: CoRR (2023)
Keyphrases
- approximation algorithms
- constant factor
- worst case
- neural network
- minimum cost
- np hard
- undirected graph
- special case
- approximation schemes
- disjoint paths
- vertex cover
- spanning tree
- facility location problem
- optimal solution
- primal dual
- set cover
- open shop
- strongly np hard
- approximation guarantees
- approximation ratio
- network design problem
- genetic algorithm
- dynamic programming
- precedence constraints
- directed acyclic graph
- directed graph
- upper bound
- connected components
- polynomial time approximation
- graph structure
- lower bound
- finding optimal
- knapsack problem
- np hardness
- random walk
- integer programming
- bipartite graph