Nam Le

Vertex Cover

Nam Le
Table of Contents

Vertex Cover #

The Vertex Cover problem seeks the smallest set of vertices such that every edge in the graph is incident to at least one vertex in the set. This is a fundamental NP-hard problem in graph theory.

Recent Literature #

  1. Learning Vertex Cover via Reinforcement Learning ICLR, 2024. paper

    Kevin Kuo, Adeola Oscar Adeniyi, Henry Hoffmann

  2. ⭐NN-Baker: Neural Network-Guided Baker’s Algorithm for Vertex Cover NeurIPS, 2024. paper, code

    Jiale Ma and Wenzheng Pan and Yang Li and Junchi Yan

  3. ⭐ GNN-based Generalization for Vertex Cover and Maximum Independent Set ICLR, 2025. paper

    Jiale Ma and Wenzheng Pan and Yang Li and Junchi Yan

Tags:
Categories: