Parameterized approximation algorithms for weighted vertex cover
type: Item
instance of: scholarly article
title: Parameterized approximation algorithms for weighted vertex cover
author: Soumen Mandal
author: Pranabendu Misra
author: Ashutosh Rai
author: Saket Saurabh
published in: Theoretical Computer Science
publication date: 2024-11-18T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 7945732
zbMATH Keywords: approximation algorithms
zbMATH Keywords: parameterized algorithms
zbMATH Keywords: weighted vertex cover
zbMATH Keywords: parameterized approximation
MaRDI profile type: MaRDI publication profile
cites work: Reducibility among Combinatorial Problems
cites work: Vertex packings: Structural properties and algorithms
cites work: Towards a proof of the 2-to-1 games conjecture?
cites work: Vertex cover might be hard to approximate to within \(2 - \varepsilon \)
cites work: Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms
cites work: Parameterized approximation via fidelity preserving transformations
cites work: A novel parameterised approximation algorithm for \textsc{minimum vertex cover}
cites work: Branching and Treewidth Based Exact Algorithms
cites work: On efficient fixed-parameter algorithms for weighted vertex cover
cites work: A multivariate framework for weighted FPT algorithms
cites work: Improved algorithms for feedback vertex set problems
cites work: Directed flow-augmentation
cites work: Parameterized complexity of weighted multicut in trees
cites work: Parameterized Algorithms
DOI: 10.1016/J.TCS.2024.114870
description: scientific article; zbMATH DE number 7945732