The h-Hop Dominating Subnetwork Problem: Variants, Structural Properties, and Exact Solution Approaches
This paper introduces the h-hop dominating subnetwork problem (HSDP), a graph-optimization problem that jointly selects a prescribed number of operational vertices, determines the dominant vertices within the selected set, and assigns each selected vertex to a dominant within a given hop range. Unlike classical dominat...