A multi-start iterated greedy algorithm for the minimum weight vertex cover \(P_3\) problem
DOI10.1016/j.amc.2018.12.067zbMath1428.05299OpenAlexW2910056170MaRDI QIDQ2008933
Lidong Wu, Jian-hua Tu, Wen-Jie Zhang
Publication date: 26 November 2019
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2018.12.067
heuristic algorithmscombinatorial optimization problemsiterated greedy algorithmminimum weight vertex cover \(P_3\) problem
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)
Cites Work
- Unnamed Item
- Multi-start iterated tabu search for the minimum weight vertex cover problem
- A fixed-parameter algorithm for the vertex cover \(P_3\) problem
- Exact algorithms for the maximum dissociation set and minimum 3-path vertex cover problems
- On computing the minimum 3-path vertex cover and dissociation number of graphs
- A primal-dual approximation algorithm for the vertex cover \(P^3\) problem
- An ant colony optimization algorithm for the minimum weight vertex cover problem
- A faster FPT algorithm for 3-path vertex cover
- Exact combinatorial algorithms and experiments for finding maximum \(k\)-plexes
- A factor \(2\) approximation algorithm for the vertex cover \(P_3\) problem
- Minimum \(k\)-path vertex cover
- On the vertex cover \(P_3\) problem parameterized by treewidth
- A Measure and Conquer Approach for the Parameterized Bounded Degree-One Vertex Deletion
- Multi-Start Methods
- A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems
This page was built for publication: A multi-start iterated greedy algorithm for the minimum weight vertex cover \(P_3\) problem
