Approximation algorithms on \(k\)-cycle transversal and \(k\)-clique transversal
type: Item
instance of: scholarly article
title: Approximation algorithms on \(k\)-cycle transversal and \(k\)-clique transversal
zbMATH Open document ID: 1488.05472
author: Zhongzheng Tang
author: Zhuo Diao
published in: Journal of the Operations Research Society of China
publication date: 2021-12-13T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 05D15
Mathematics Subject Classification ID: 05C22
zbMATH DE Number: 7443761
zbMATH Keywords: \(k\)-cycle transversal
zbMATH Keywords: \(k\)-clique transversal
zbMATH Keywords: approximation algorithms
MaRDI profile type: Publication
full work available at URL: s40305-020-00335-4
OpenAlex ID: W3119171189
cites work: Node-and edge-deletion NP-complete problems
cites work: On a conjecture of Tuza about packing and covering of triangles
cites work: Approximating Maximum Subgraphs without Short Cycles
cites work: Vertex cover might be hard to approximate to within \(2 - \varepsilon \)
cites work: On the small cycle transversal of planar graphs
cites work: Kernelization for cycle transversal problems
cites work: On generating triangle-free graphs
cites work: A conjecture on triangles of graphs
cites work: Packing and covering triangles in tripartite graphs
cites work: Packing and covering triangles in graphs
cites work: Packing and covering triangles in planar graphs
cites work: Packing and covering triangles in \(K_{4}\)-free planar graphs
cites work: Sufficient Conditions for Tuza’s Conjecture on Packing and Covering Triangles
cites work: Total Dual Integrality of Triangle Covering
cites work: Covering triangles in edge-weighted graphs
cites work: On the structure of linear graphs
cites work: Q3996998
DOI: 10.1007/S40305-020-00335-4
description: scientific article; zbMATH DE number 7443761