| Presentation | 2020-03-01 [Invited Talk] Adaptive Algorithm for Finding Connected Dominating Sets in Uncertain Graphs Takuro Fukunaga, |
|---|---|
| PDF Download Page |  PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | The problem of finding a minimum-weight connected dominating set (CDS) of a given undirected graph has been studied actively, motivated by operations of wireless ad hoc networks. In this paper, we formulate a new stochastic variant of the problem. In this problem, each node in the graph has a hidden random state, which represents whether the node is active or inactive, and we seek a CDS of the graph that consists of the active nodes. We consider an adaptive algorithm for this problem, which repeat choosing nodes and observing the states of the nodes around the chosen nodes until a CDS is found. Our algorithms have a theoretical performance guarantee that the sum of the weights of the nodes chosen by the algorithm is at most O(alpha log (1/delta)) times that of any adaptive algorithm in expectation, where alph$ is an approximation factor for the node-weighted polymatroid Steiner tree problem and delta is the minimum probability of possible scenarios on the node states. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | connected dominating set / adaptive optimization / polymatroid Steiner tree |
| Paper # | COMP2019-48 |
| Date of Issue | 2020-02-23 (COMP) |
| Conference Information | |
| Committee | COMP |
|---|---|
| Conference Date | 2020/3/1(1days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | The University of Electro-Communications |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | |
| Chair | Toshihiro Fujito(Toyohashi Univ. of Tech.) |
| Vice Chair | Shinichi Nakano(Gunma Univ.) |
| Secretary | Shinichi Nakano(Kumamoto Univ) |
| Assistant | Kazuhisa Seto(Seikei Univ.) |
| Paper Information | |
| Registration To | Technical Committee on Theoretical Foundations of Computing |
|---|---|
| Language | ENG |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | [Invited Talk] Adaptive Algorithm for Finding Connected Dominating Sets in Uncertain Graphs |
| Sub Title (in English) | |
| Keyword(1) | connected dominating set |
| Keyword(2) | adaptive optimization |
| Keyword(3) | polymatroid Steiner tree |
| 1st Author's Name | Takuro Fukunaga |
| 1st Author's Affiliation | Chuo University(Chuo Univ.) |
| Date | 2020-03-01 |
| Paper # | COMP2019-48 |
| Volume (vol) | vol.119 |
| Number (no) | COMP-433 |
| Page | pp.pp.23-23(COMP), |
| #Pages | 1 |
| Date of Issue | 2020-02-23 (COMP) |