Information: Join today and make your research activities more affordable! Technical workshop participation fees and annual registration fees are available at member rates.
Notice: [Important] Announcement of Changes to Registration Fee Payment and Manuscript Upload Procedures for IEICE Technical Meetings
IEICE Technical Committee Submission System
Conference Paper's Information		 Online Proceedings
[Sign in]
Tech. Rep. Archives
 Go Top Page Go Previous   [Japanese] / [English] 

Paper Abstract and Keywords
Presentation 2020-03-01 11:30
[Invited Talk] Adaptive Algorithm for Finding Connected Dominating Sets in Uncertain Graphs
Takuro Fukunaga (Chuo Univ.) COMP2019-48
Abstract (in Japanese) (See Japanese page) 
(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) 
(in English) connected dominating set / adaptive optimization / polymatroid Steiner tree / / / / /  
Reference Info. IEICE Tech. Rep., vol. 119, no. 433, COMP2019-48, pp. 23-23, March 2020.
Paper # COMP2019-48 
Date of Issue 2020-02-23 (COMP) 
ISSN Online edition: ISSN 2432-6380
Copyright
and
reproduction		 All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034)
Download PDF COMP2019-48

Conference Information
Committee COMP  
Conference Date 2020-03-01 - 2020-03-01 
Place (in Japanese) (See Japanese page) 
Place (in English) The University of Electro-Communications 
Topics (in Japanese) (See Japanese page) 
Topics (in English)  
Paper Information
Registration To COMP 
Conference Code 2020-03-COMP 
Language English 
Title (in Japanese) (See Japanese page) 
Sub Title (in Japanese) (See Japanese page) 
Title (in English) 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  
Keyword(4)  
Keyword(5)  
Keyword(6)  
Keyword(7)  
Keyword(8)  
1st Author's Name Takuro Fukunaga  
1st Author's Affiliation Chuo University (Chuo Univ.)
2nd Author's Name  
2nd Author's Affiliation ()
3rd Author's Name  
3rd Author's Affiliation ()
4th Author's Name  
4th Author's Affiliation ()
5th Author's Name  
5th Author's Affiliation ()
6th Author's Name  
6th Author's Affiliation ()
7th Author's Name  
7th Author's Affiliation ()
8th Author's Name  
8th Author's Affiliation ()
9th Author's Name  
9th Author's Affiliation ()
10th Author's Name  
10th Author's Affiliation ()
11th Author's Name  
11th Author's Affiliation ()
12th Author's Name  
12th Author's Affiliation ()
13th Author's Name  
13th Author's Affiliation ()
14th Author's Name  
14th Author's Affiliation ()
15th Author's Name  
15th Author's Affiliation ()
16th Author's Name  
16th Author's Affiliation ()
17th Author's Name  
17th Author's Affiliation ()
18th Author's Name  
18th Author's Affiliation ()
19th Author's Name  
19th Author's Affiliation ()
20th Author's Name  
20th Author's Affiliation ()
21st Author's Name  
21st Author's Affiliation ()
22nd Author's Name  
22nd Author's Affiliation ()
23rd Author's Name  
23rd Author's Affiliation ()
24th Author's Name  
24th Author's Affiliation ()
25th Author's Name  
25th Author's Affiliation ()
26th Author's Name / /
26th Author's Affiliation ()
()
27th Author's Name / /
27th Author's Affiliation ()
()
28th Author's Name / /
28th Author's Affiliation ()
()
29th Author's Name / /
29th Author's Affiliation ()
()
30th Author's Name / /
30th Author's Affiliation ()
()
31st Author's Name / /
31st Author's Affiliation ()
()
32nd Author's Name / /
32nd Author's Affiliation ()
()
33rd Author's Name / /
33rd Author's Affiliation ()
()
34th Author's Name / /
34th Author's Affiliation ()
()
35th Author's Name / /
35th Author's Affiliation ()
()
36th Author's Name / /
36th Author's Affiliation ()
()
Speaker Author-1 
Date Time 2020-03-01 11:30:00 
Presentation Time 60 minutes 
Registration for COMP 
Paper # COMP2019-48 
Volume (vol) vol.119 
Number (no) no.433 
Page p.23 
#Pages 1 
Date of Issue 2020-02-23 (COMP) 

[Return to Top Page]

[Return to IEICE Web Page]
The Institute of Electronics, Information and Communication Engineers (IEICE), Japan