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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Theoretical computer science Jg. 1021; S. 114870
Hauptverfasser:	Mandal, Soumen, Misra, Pranabendu, Rai, Ashutosh, Saurabh, Saket
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 21.12.2024
Schlagworte:	Approximation algorithms Parameterized algorithms Parameterized approximation Weighted vertex cover Approximation algorithms Parameterized algorithms Parameterized approximation Weighted vertex cover
ISSN:	0304-3975
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!