Parameterized algorithms for minimum sum vertex cover

A minimum sum vertex cover of an n-vertex graph G is a bijection ϕ:V(G)→[n] that minimizes the cost ∑{u,v}∈E(G)min⁡{ϕ(u),ϕ(v)}. Finding a minimum sum vertex cover of a graph (the MSVC problem) is NP-hard. MSVC is studied well in the realm of approximation algorithms. The best-known approximation fac...

Full description

Bibliographic Details

Published in:	Theoretical computer science Vol. 1029; p. 115032
Main Authors:	Aute, Shubhada, Panolan, Fahad
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 02.03.2025
Subjects:	FPT Integer quadratic programming Vertex cover Vertex cover Integer quadratic programming FPT
ISSN:	0304-3975
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!