Extension of the Nemhauser and Trotter Theorem to Generalized Vertex Cover with Applications
From MaRDI portal
Publication:3558909
DOI10.1007/978-3-642-12450-1_2zbMath1284.68653OpenAlexW2106412619MaRDI QIDQ3558909
Danny Hermelin, Reuven Bar Yehuda, Dror Rawitz
Publication date: 11 May 2010
Published in: Approximation and Online Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-12450-1_2
Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items
Local maximum stable set greedoids stemming from very well-covered graphs ⋮ On local maximum stable set greedoids ⋮ Crowns in bipartite graphs
This page was built for publication: Extension of the Nemhauser and Trotter Theorem to Generalized Vertex Cover with Applications