A unified local ratio approximation of node-deletion problems
From MaRDI portal
Publication:4595485
DOI10.1007/3-540-61680-2_54zbMath1379.68350OpenAlexW1489668163MaRDI QIDQ4595485
Publication date: 5 December 2017
Published in: Algorithms — ESA '96 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-61680-2_54
Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items (4)
Rank Correlation Coefficient Correction by Removing Worst Cases ⋮ A primal-dual approach to approximation of node-deletion problems for matroidal properties ⋮ Approximating power node-deletion problems ⋮ On approximation of the submodular set cover problem
This page was built for publication: A unified local ratio approximation of node-deletion problems
