Server placements, Roman domination and other dominating set variants
Aris Pagourtzis, Penna, Paolo, Schlude, Konrad, Steinhöfel, Kathleen, Taylor, David Scot, Widmayer, Peter · 2001
Dominating sets in their many variations model a wealth of optimizationproblems like facility location or distributed file sharing. Forinstance, when a request can occur at any node in a graph and requiresa server at that node, a minimumdominating set represents a minimumset of servers that serve an arbitrary single request by moving a serveralong at most one edge. This paper