Leveraging our cutting-edge work on node dominating sets, we present an efficient 2-approximation algorithm for edge dominating sets in sparse graphs—delivering practical solutions for this NP-hard challenge. Ready to use: https://pypi.org/project/loynaz/