A constant-factor approximation for weighted bond cover

The WeightedF-Vertex Deletion for a class F of graphs asks, weighted graph G, for a minimum weight vertex set S such that G−S∈F. The case when F is minor-closed and excludes some graph as a minor has received particular attention but a constant-factor approximation remained elusive for WeightedF-Ver...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of computer and system sciences Vol. 149; p. 103617
Main Authors:	Kim, Eun Jung, Lee, Euiwoong, Thilikos, Dimitrios M.
Format:	Journal Article
Language:	English
Published:	Elsevier Inc 01.05.2025 Elsevier
Subjects:	Bonds in graphs Computer Science Constant-factor approximation algorithms Data Structures and Algorithms Discrete Mathematics Graph minors Graph modification problems Primal-dual method Constant-factor approximation algorithms Bonds in graphs Graph modification problems Graph minors Primal-dual method
ISSN:	0022-0000, 1090-2724
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!