Approximating Element-Weighted Vertex Deletion Problems for the Complete k-Partite Property

DOI10.1006/jagm.2001.1196zbMath0990.68099OpenAlexW2088230289MaRDI QIDQ2777604

Dror Rawitz, Reuven Bar Yehuda

Publication date: 14 August 2002

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jagm.2001.1196

zbMATH Keywords

weighted vertex cover problemcomplete \(k\)-partiteedge clique complement problem

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (2)

Combination of parallel machine scheduling and vertex cover ⋮ Parameterized Graph Editing with Chosen Vertex Degrees

This page was built for publication: Approximating Element-Weighted Vertex Deletion Problems for the Complete k-Partite Property