VNU-UET Repository

An Efficient Algorithm for the k-Dominating Set Problem on Very Large-Scale Networks

Nguyen, Minh Hai and Ha, Minh Hoang and Dinh, Thai Hoang and Diep, Nguyen and Dutkiewicz, Eryk and Tran, The Trung (2019) An Efficient Algorithm for the k-Dominating Set Problem on Very Large-Scale Networks. In: CSoNet 2019, Ho Chi Minh.

[img]
Preview
PDF
Download (158kB)

Abstract

The minimum dominating set problem (MDSP) aims to construct the minimum-size subset D⊂V of a graph G=(V,E) such that every vertex has at least one neighbor in D. The problem is proved to be NP-hard [5]. In a recent industrial application, we encountered a more general variant of MDSP that extends the neighborhood relationship as follows: a vertex is a k-neighbor of another if there exists a linking path through no more than k edges between them. This problem is called the minimum k-dominating set problem (MkDSP) and the dominating set is denoted as D_k. The MkDSP can be used to model applications in social networks [2] and design of wireless sensor networks [3]. In our case, a telecommunication company uses the problem model to supervise a large social network up to 17 millions nodes via a dominating subset in which k is set to 3.

Item Type: Conference or Workshop Item (Paper)
Subjects: Information Technology (IT)
Divisions: Faculty of Information Technology (FIT)
Depositing User: Hà Minh Hoàng
Date Deposited: 29 Nov 2019 03:37
Last Modified: 29 Nov 2019 05:53
URI: http://eprints.uet.vnu.edu.vn/eprints/id/eprint/3673

Actions (login required)

View Item View Item