Parameterized approximation algorithms for weighted vertex cover

A vertex cover of a graph is a set of vertices of the graph such that every edge has at least one endpoint in it. In this work, we study Weighted Vertex Cover with solution size as a parameter. Formally, in the (k,W)-Vertex Cover problem, given a graph G, an integer k, a positive rational W, and a w...

Full description

Bibliographic Details

Published in:	Theoretical computer science Vol. 1021; p. 114870
Main Authors:	Mandal, Soumen, Misra, Pranabendu, Rai, Ashutosh, Saurabh, Saket
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 21.12.2024
Subjects:	Approximation algorithms Parameterized algorithms Parameterized approximation Weighted vertex cover Approximation algorithms Parameterized algorithms Parameterized approximation Weighted vertex cover
ISSN:	0304-3975
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!