A unified local ratio approximation of node-deletion problems

DOI10.1007/3-540-61680-2_54MaRDI QIDQ4595485zbMATH OpenOpenAlexFDO

Authors Toshihiro Fujito

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

Mathematics Subject Classification ID

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

Recommendations

• A unified approximation algorithm for node-deletion problems
• A new approach for approximating node deletion problems
• Approximating power node-deletion problems
• Approximating Node-Deletion Problems for Matroidal Properties
• Approximation algorithms for node deletion problems on bipartite graphs with finite forbidden subgraph characterization
• Approximation algorithm for (connected) bounded-degree deletion problem on unit disk graphs
• Approximating partially bounded degree deletion on directed graphs
• Approximating partially bounded degree deletion on directed graphs
• A primal-dual approach to approximation of node-deletion problems for matroidal properties

Cited in

(7)

• Approximating power node-deletion problems
• Approximating power node-deletion problems
• Rank correlation coefficient correction by removing worst cases
• Additive approximation for edge-deletion problems
• On approximation of the submodular set cover problem
• A primal-dual approach to approximation of node-deletion problems for matroidal properties
• A new approach for approximating node deletion problems

This page was built for publication: A unified local ratio approximation of node-deletion problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4595485)