A multi-start iterated greedy algorithm for the minimum weight vertex cover P3 problem

被引:6
作者
Zhang, Wenjie [1 ]
Tu, Jianhua [1 ]
Wu, Lidong [2 ]
机构
[1] Beijing Univ Chem Technol, Dept Math, Beijing 100029, Peoples R China
[2] Univ Texas Tyler, Dept Comp Sci, Tyler, TX 75799 USA
关键词
Iterated greedy algorithm; Minimum weight vertex cover P-3 problem; Heuristic algorithms; Combinatorial optimization problems; APPROXIMATION ALGORITHM;
D O I
10.1016/j.amc.2018.12.067
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
Given a vertex-weighted graph G = (V, E) and a positive integer k >= 2, the minimum weight vertex cover P-k (MWVCPk) problem is to find a vertex subset F subset of V with minimum total weight such that every path of order k in G contains at least one vertex in F. For any integer k >= 2, the MWVCPk problem for general graphs is NP-hard. In this paper, we restrict our attention to the MWVCP3 problem and present a multi-start iterated greedy algorithm to solve the MWVCP3 problem. The experiments are carried out on randomly generated instances with up to 1000 vertices and 250000 edges. Our work is the first one to adopt heuristic algorithms to solve the MWVCP3 problem, and the experimental results show that our algorithm performs reasonably well in practice. (C) 2019 Elsevier Inc. All rights reserved.
引用
收藏
页码:359 / 366
页数:8
相关论文
共 19 条
[1]   A Randomized Iterated Greedy Algorithm for the Founder Sequence Reconstruction Problem [J].
Benedettini, Stefano ;
Blum, Christian ;
Roli, Andrea .
LEARNING AND INTELLIGENT OPTIMIZATION, 2010, 6073 :37-+
[2]  
Bondy J.A., 2008, GTM
[3]   A population-based iterated greedy algorithm for the minimum weight vertex cover problem [J].
Bouamama, Salim ;
Blum, Christian ;
Boukerram, Abdellah .
APPLIED SOFT COMPUTING, 2012, 12 (06) :1632-1639
[4]   Minimum k-path vertex cover [J].
Bresar, Bostjan ;
Kardos, Frantisek ;
Katrenic, Jan ;
Semanisin, Gabriel .
DISCRETE APPLIED MATHEMATICS, 2011, 159 (12) :1189-1195
[5]  
Chang M-S., 2014, 31 WORKSHOP COMBINAT, P9
[6]  
Fellows MR, 2011, ACM T COMPUT THEORY, V2, P1
[7]   On computing the minimum 3-path vertex cover and dissociation number of graphs [J].
Kardos, Frantisek ;
Katrenic, Jan ;
Schiermeyer, Ingo .
THEORETICAL COMPUTER SCIENCE, 2011, 412 (50) :7009-7017
[8]   A faster FPT algorithm for 3-path vertex cover [J].
Katrenic, Jan .
INFORMATION PROCESSING LETTERS, 2016, 116 (04) :273-278
[9]  
Marti R., 2003, HDB METAHEURISTICS I, V57
[10]   Exact combinatorial algorithms and experiments for finding maximum k-plexes [J].
Moser, Hannes ;
Niedermeier, Rolf ;
Sorge, Manuel .
JOURNAL OF COMBINATORIAL OPTIMIZATION, 2012, 24 (03) :347-373