1 citations · 1 across the 5 of their papers we have counts for
1 paper · 2 filters
Hunter Rehm, Robert Kassouf-Short, Puck Rombach
The dominating set problem has many practical applications but is well-known to be NP-hard. Therefore, there is a need for efficient approximation algorithms, especially in applica…