Related papers: Vertex cover problem studied by cavity method: Ana…
The goal in the stochastic vertex cover problem is to obtain an approximately minimum vertex cover for a graph $G^\star$ that is realized by sampling each edge independently with some probability $p\in (0, 1]$ in a base graph $G = (V, E)$.…
We study the minimum vertex cover problem in the following stochastic setting. Let $G$ be an arbitrary given graph, $p \in (0, 1]$ a parameter of the problem, and let $G_p$ be a random subgraph that includes each edge of $G$ independently…
We give efficient distributed algorithms for the minimum vertex cover problem in bipartite graphs in the CONGEST model. From K\H{o}nig's theorem, it is well known that in bipartite graphs the size of a minimum vertex cover is equal to the…
We study numerically the region above the critical temperature of the four dimensional Random Field Ising Model. Using a cluster dynamic we measure the connected and disconnected magnetic susceptibility and the connected and disconnected…
The Connected Vertex Cover problem, where the goal is to compute a minimum set of vertices in a given graph which forms a vertex cover and induces a connected subgraph, is a fundamental combinatorial problem and has received extensive…
This paper proposes a novel branch-and-bound(BMWVC) algorithm to exactly solve the minimum weight vertex cover problem (MWVC) in large graphs. The original contribution is several new graph reduction rules, allowing to reduce a graph G and…
The vertex-cover problem on the Hanoi networks HN3 and HN5 is analyzed with an exact renormalization group and parallel-tempering Monte Carlo simulations. The grand canonical partition function of the equivalent hard-core repulsive…
A connected covering is a design system in which the corresponding {\em block graph} is connected. The minimum size of such coverings are called {\em connected coverings numbers}. In this paper, we present various formulas and bounds for…
We obtain a new lower bound for the eternal vertex cover number of an arbitrary graph $G$, in terms of the cardinality of a vertex cover of minimum size in $G$ containing all its cut vertices. The consequences of the lower bound includes a…
We study the metastability of the ferromagnetic Ising model on a random $r$-regular graph in the zero temperature limit. We prove that in the presence of a small positive external field the time that it takes to go from the all minus state…
The random field Ising model is studied numerically at both zero and positive temperature. Ground states are mapped out in a region of random and external field strength. Thermal states and thermodynamic properties are obtained for all…
Lower temperature leads to a higher probability of visiting low-energy states. This intuitive belief underlies most physics-inspired strategies for addressing hard optimization problems. For instance, the popular simulated annealing (SA)…
The problem of finding an optimal vertex cover in a graph is a classic NP-complete problem, and is a special case of the hitting set question. On the other hand, the hitting set problem, when asked in the context of induced geometric…
We consider zero-temperature, stochastic Ising models with nearest-neighbor interactions and an initial spin configuration chosen from a symmetric Bernoulli distribution (corresponding physically to a deep quench). Whether a final state…
Statistical mechanics is widely applied to solve hard optimization problem, the optimal strategy related to ground state energy that depends on low temperature. Common thermodynamic process is expected to approach the ground state energy if…
The random field Ising model in three dimensions with Gaussian random fields is studied at zero temperature for system sizes up to 60^3. For each realization of the normalized random fields, the strength of the random field, Delta and a…
In the eternal vertex cover problem, mobile guards on the vertices of a graph are used to defend it against an infinite sequence of attacks on its edges by moving to neighbor vertices. The eternal vertex cover problem consists in…
We investigate thermodynamic phase transitions of the joint presence of spin glass (SG) and random field (RF) using a random graph model that allows us to deal with the quenched disorder. Therefore, the connectivity becomes a controllable…
We consider zero-temperature, stochastic Ising models with nearest-neighbor interactions in two and three dimensions. Using both symmetric and asymmetric initial configurations, we study the evolution of the system with time. We examine the…
We study the Minimum Sum Vertex Cover problem, which asks for an ordering of vertices in a graph that minimizes the total cover time of edges. In particular, n vertices of the graph are visited according to an ordering, and for each edge…