On the weighted \(k\)-path vertex cover problem
type: Item
instance of: scholarly article
title: On the weighted \(k\)-path vertex cover problem
zbMATH Open document ID: 1297.05103
published in: Discrete Applied Mathematics
publication date: 2014-09-08T00:00:00Z
Mathematics Subject Classification ID: 05C22
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 6341116
zbMATH Keywords: weighted graph
zbMATH Keywords: vertex cover
zbMATH Keywords: graph algorithm
author: Boštjan Brešar
author: R. Krivoš-Belluš
author: Gabriel Semanišin
author: Petra Šparl
MaRDI profile type: Publication
full work available at URL: j.dam.2014.05.042
OpenAlex ID: W2038294264
cites work: On the vertex \(k\)-path cover
cites work: Minimum \(k\)-path vertex cover
cites work: On F-independence in graphs
cites work: A Primal-Dual Bicriteria Distributed Algorithm for Capacitated Vertex Cover
cites work: Improved Approximation Algorithms for the Vertex Cover Problem in Graphs and Hypergraphs
cites work: On the \(k\)-path vertex cover of some graph products
cites work: On computing the minimum 3-path vertex cover and dissociation number of graphs
cites work: PTAS for the minimum \(k\)-path connected vertex cover problem in unit disk graphs
cites work: A factor \(2\) approximation algorithm for the vertex cover \(P_3\) problem
cites work: A primal-dual approximation algorithm for the vertex cover \(P^3\) problem
cites work: Node-Deletion Problems on Bipartite Graphs
DOI: 10.1016/J.DAM.2014.05.042
description: scientific article; zbMATH DE number 6341116