An efficient local search for the feedback vertex set problem

DOI10.3390/a6040726zbMath1461.90128OpenAlexW2078622513MaRDI QIDQ1736593

Zehui Shao, Xiaoqing Zhou, Ansheng Ye, Zhi-Qiang Zhang

Publication date: 26 March 2019

Published in: Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3390/a6040726

zbMATH Keywords

local searchheuristicfeedback vertex setvariable depth search

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Local search is a PTAS for feedback vertex set in minor-free graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• Variable neighborhood search for the maximum clique
• An effective local search for the maximum clique problem
• Variable neighborhood search
• Solving the maximum clique problem using a tabu search approach
• Phased local search for the maximum clique problem
• A graph coloring heuristic using partial solutions and a reactive tabu scheme
• Chained Lin-Kernighan for Large Traveling Salesman Problems
• Tabu Search—Part I
• Tabu Search—Part II
• An Efficient Heuristic Procedure for Partitioning Graphs
• Reducibility among Combinatorial Problems
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• Variable neighborhood search: Principles and applications
• Reactive local search for the maximum clique problem

This page was built for publication: An efficient local search for the feedback vertex set problem