Results 271 to 280 of about 2,372,931 (298)

Elimination Distances, Blocking Sets, and Kernels for Vertex Cover

Symposium on Theoretical Aspects of Computer Science, 2019
The Vertex Cover problem plays an essential role in the study of polynomial kernelization in parameterized complexity, i.e., the study of provable and efficient preprocessing for NP-hard problems.
Eva-Maria C. Hols, Stefan Kratsch, A. Pieterse   +2 more
semanticscholar   +1 more source

A new robust approach to solve minimum vertex cover problem: Malatya vertex-cover algorithm

Journal of Supercomputing, 2023
Selman Yakut, Furkan Öztemiz, A. Karcı
semanticscholar   +1 more source

Toward the minimum vertex cover of complex networks using distributed potential games

Science China Information Sciences, 2022
Jie Chen, Xiang Li
semanticscholar   +1 more source

Digitally Annealed Solution for the Vertex Cover Problem with Application in Cyber Security

IEEE International Conference on Acoustics, Speech, and Signal Processing, 2019
Cyber attacks on the power systems can mislead the control center to produce incorrect state and topology estimate. State and topology attacks can have harmful impacts on the operation of a power system.
Mohammad Javad-Kalbasi, Keivan Dabiri, S. Valaee, A. Sheikholeslami   +3 more
semanticscholar   +1 more source

Applying the quantum approximate optimization algorithm to the minimum vertex cover problem

Applied Soft Computing, 2022
Y.J. Zhang, X. Mu, X.W. Liu, X.Y. Wang, X. Zhang, K. Li, T. Wu, D. Zhao, C. Dong   +8 more
semanticscholar   +1 more source

A Note on Max k-Vertex Cover: Faster FPT-AS, Smaller Approximate Kernel and Improved Approximation

SIAM Symposium on Simplicity in Algorithms, 2018
In Maximum $k$-Vertex Cover (Max $k$-VC), the input is an edge-weighted graph $G$ and an integer $k$, and the goal is to find a subset $S$ of $k$ vertices that maximizes the total weight of edges covered by $S$. Here we say that an edge is covered by $S$
Pasin Manurangsi
semanticscholar   +1 more source

A primal-dual approximation algorithm for the k-prize-collecting minimum vertex cover problem with submodular penalties

Frontiers of Computer Science, 2022
Xiaofei Liu, Weidong Li, Jinhua Yang
semanticscholar   +1 more source

NuMWVC: A novel local search for minimum weighted vertex cover problem

Journal of the Operational Research Society, 2019
The problem of finding a minimum weighted vertex cover (MWVC) in a graph is a well-known combinatorial optimisation problem with important applications.
Ruizhi Li, Shuli Hu, Shaowei Cai, Jian Gao, Yiyuan Wang, Minghao Yin   +5 more
semanticscholar   +1 more source

Bridge-Depth Characterizes which Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel

International Colloquium on Automata, Languages and Programming, 2020
Marin Bougeret, B. Jansen, Ignasi Sau
semanticscholar   +1 more source

Approximating Bipartite Minimum Vertex Cover in the CONGEST Model

International Conference on Principles of Distributed Systems, 2020
Salwa Faour, F. Kuhn
semanticscholar   +1 more source