Revisiting Connected Vertex Cover: FPT Algorithms and Lossy Kernels
Sign Up to like & getrecommendations! Published in 2017 at "Theory of Computing Systems"
DOI: 10.1007/s00224-017-9837-y
Abstract: AbstractThe Connected Vertex Cover problem asks for a vertex cover in a graph that induces a connected subgraph. The problem is known to be fixed-parameter tractable (FPT), and is unlikely to have a polynomial sized… read more here.
Keywords: lceil frac; frac alpha; vertex cover; connected vertex ... See more keywords
Connected Vertex Cover for $$(sP_1+P_5)$$(sP1+P5)-Free Graphs
Sign Up to like & getrecommendations! Published in 2019 at "Algorithmica"
DOI: 10.1007/s00453-019-00601-9
Abstract: The Connected Vertex Cover problem is to decide if a graph G has a vertex cover of size at most k that induces a connected subgraph of G. This is a well-studied problem, known to be NP-complete for restricted… read more here.
Keywords: problem; vertex cover; free graphs; connected vertex ... See more keywords
A simpler PTAS for connected k-path vertex cover in homogeneous wireless sensor network
Sign Up to like & getrecommendations! Published in 2018 at "Journal of Combinatorial Optimization"
DOI: 10.1007/s10878-018-0283-9
Abstract: Because of its application in the field of security in wireless sensor networks, k-path vertex cover ($$\hbox {VCP}_k$$VCPk) has received a lot of attention in recent years. Given a graph $$G=(V,E)$$G=(V,E), a vertex set $$C\subseteq… read more here.
Keywords: vertex; path vertex; vertex cover; wireless sensor ... See more keywords
A novel algorithm for the vertex cover problem based on minimal elements of discernibility matrix
Sign Up to like & getrecommendations! Published in 2019 at "International Journal of Machine Learning and Cybernetics"
DOI: 10.1007/s13042-019-00933-6
Abstract: Minimal vertex cover problem (MVCP) is a famous important NP-hard problem in graph theory. It has been reported that MVCP is equivalent to finding reducts of information systems in rough sets theory. This relationship motivates… read more here.
Keywords: cover problem; minimal elements; vertex cover; discernibility matrix ... See more keywords
Statistical mechanics of the minimum vertex cover problem in stochastic block models.
Sign Up to like & getrecommendations! Published in 2019 at "Physical review. E"
DOI: 10.1103/physreve.100.062101
Abstract: The minimum vertex cover (Min-VC) problem is a well-known NP-hard problem. Earlier studies illustrate that the problem defined over the Erdös-Rényi random graph with a mean degree c exhibits computational difficulty in searching the Min-VC… read more here.
Keywords: problem; minimum vertex; vertex cover; stochastic block ... See more keywords
Cutting-plane algorithms and solution whitening for the vertex-cover problem.
Sign Up to like & getrecommendations! Published in 2022 at "Physical review. E"
DOI: 10.1103/physreve.106.035305
Abstract: The phase-transition behavior of the NP-hard vertex-cover (VC) combinatorial optimization problem is studied numerically by linear programming (LP) on ensembles of random graphs. As the basic Simplex (SX) algorithm suitable for such LPs may produce… read more here.
Keywords: problem; transition; cutting plane; vertex cover ... See more keywords