Approximating partially bounded degree deletion on directed graphs

DOI10.1007/978-3-319-75172-6_4zbMath1498.05113OpenAlexW2788330089MaRDI QIDQ1641092

Yuki Mizuno, Toshihiro Fujito, Kei Kimura

Publication date: 15 June 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-75172-6_4

zbMATH Keywords

approximation algorithmspartial coverbounded degree deletion

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Directed graphs (digraphs), tournaments (05C20) Vertex degrees (05C07)

Related Items

Approximating Partially Bounded Degree Deletion on Directed Graphs