Solving the feedback vertex set problem on undirected graphs
type: Item
instance of: scholarly article
title: Solving the feedback vertex set problem on undirected graphs
zbMATH Open document ID: 0946.90098
DOI: 10.1016/S0166-218X(99)00180-8
author: Lorenzo Brunetta
author: Francesco Maffioli
author: Marco Trubian
published in: Discrete Applied Mathematics
publication date: 2000-04-09T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 1428615
zbMATH Keywords: feedback vertex set
zbMATH Keywords: branch-and-cut
zbMATH Keywords: local search heuristic
zbMATH Keywords: tabu search
MaRDI profile type: Publication
cites work: Q3128894
cites work: Q4398380
cites work: A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs
cites work: A Greedy Heuristic for the Set-Covering Problem
cites work: Feedback vertex set on cocomparability graphs
cites work: Solution of large weighted equicut problems
cites work: A polyhedral approach to the feedback vertex set problem
cites work: Tabu Search—Part I
cites work: Reducibility among Combinatorial Problems
cites work: Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms
cites work: On locating minimum feedback vertex sets
cites work: Almost exact minimum feedback vertex set in meshes and butterflies
cites work: A linear-time algorithm for the weighted feedback vertex problem on interval graphs
cites work: Feedback vertex sets and cyclically reducible graphs
cites work: Constant ratio approximations of the weighted feedback vertex set problem for undirected graphs
Wikidata QID: Q126621766
description: scientific article; zbMATH DE number 1428615