Long-range frustration in Minimal Vertex Cover Problem on random graphs
Yu-Tao Li, Chun-Yan Zhao, and Jin-Hua Zhao

TL;DR
This paper develops a theoretical framework to analyze the long-range frustration effects in the minimal vertex cover problem on random graphs, providing more accurate estimates of energy densities and insights into the problem's complex energy landscape.
Contribution
It introduces a percolation-based theoretical model for long-range frustration in MVC, improving predictions over existing methods that ignore such effects.
Findings
Predictions align closely with hybrid algorithm results.
LRF significantly influences the energy landscape of MVC.
The framework effectively estimates ground-state properties on sparse random graphs.
Abstract
A vertex cover on a graph is a set of vertices in which each edge of the graph is adjacent to at least one vertex in the set. The Minimal Vertex Cover (MVC) Problem concerns finding vertex covers with a smallest cardinality. The MVC problem is a typical computationally hard problem among combinatorial optimization on graphs, for which both developing fast algorithms to find solution configurations on graph instances and constructing an analytical theory to estimate their ground-state properties prove to be difficult tasks. Here, by considering the long-range frustration (LRF) among MVC configurations and formulating it into a theoretical framework of a percolation model, we analytically estimate the energy density of MVCs on sparse random graphs only with their degree distributions. We test our framework on some typical random graph models. We show that, when there is a percolation of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComplexity and Algorithms in Graphs · Advanced Graph Theory Research · Vehicle Routing Optimization Methods
