A note on approximations of directed edge dominating set

DOI10.1016/j.ipl.2022.106303OpenAlexW4289444065WikidataQ114167064 ScholiaQ114167064MaRDI QIDQ2094379

Toshihiro Fujito

Publication date: 28 October 2022

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2022.106303

zbMATH Keywords

approximation algorithmsLP relaxationdirected edge dominating set

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Approximating edge dominating set in dense graphs
• On directed covering and domination problems
• Approximation hardness of edge dominating set problems
• Minimum Edge Dominating Sets
• Edge Dominating Sets in Graphs
• Approximation algorithms for NP-complete problems on planar graphs
• New Results on Directed Edge Dominating Set

This page was built for publication: A note on approximations of directed edge dominating set