Abstract
AbstractSuppose that in a network, a node can dominate (or cover, monitor, etc) its neighbor nodes. An interesting question asks to find such a minimum set of nodes that dominate all the other nodes. This is known as the minimum dominating set problem. A natural generalization assumes that a node can dominate nodes within a distance R ≥ 1, called the minimum distance dominating set problem. On the other hand, if the distance between any two nodes in the dominating set must be at least z ≥ 1, then the problem is known as the minimum independent dominating set problem. This paper considers to find a minimum distance-R independence-z dominating set for arbitrary R and z, which has applications in facility location, internet monitoring and others. We show a practical approach. Empirical studies show that usually it is very fast and quite accurate, thus suitable for Big Data analysis. Generalization to directed graphs, edge lengths, multi-dominating are also discussed.KeywordsWireless Sensor NetworkGreedy AlgorithmRandom GraphPriority QueueChordal GraphThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
