no code implementations • NeurIPS 2021 • Evan McCarty, Qi Zhao, Anastasios Sidiropoulos, Yusu Wang
This leads to a mixed algorithmic-ML framework, which we call NN-Baker that has the capacity to approximately solve a family of graph optimization problems (e. g, maximum independent set and minimum vertex cover) in time linear to input graph size, and only polynomial to approximation parameter.