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

Celý popis

Podrobná bibliografia

Vydané v:	Theoretical computer science Ročník 1021; s. 114870
Hlavní autori:	Mandal, Soumen, Misra, Pranabendu, Rai, Ashutosh, Saurabh, Saket
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 21.12.2024
Predmet:	Approximation algorithms Parameterized algorithms Parameterized approximation Weighted vertex cover Approximation algorithms Parameterized algorithms Parameterized approximation Weighted vertex cover
ISSN:	0304-3975
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!