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 2006-03-07 11:45
Maximum-Cover Source-Location Problem with Objective Edge-Connectivity Three
Kenya Sugihara, Hiro Ito (Kyoto Univ.)
Abstract (in Japanese) (See Japanese page) 
(in English) Given a graph $G=(V,E)$, a set of vertices $S\subseteq V$ covers a vertex $v\in V$ if the edge-connectivity between $S$ and $v$ is at least a given number $k$. Vertices in $S$ are called sources. The maximum-cover source-location problem, which is a variation of the source location problem, is to find a source set $S$ with a given size at most $p$, maximizing the sum of the weight of vertices covered by $S$. In this paper, we show a polynomial-time algorithm for this problem in the case of $k=3$ when a vertex-weighted and edge-capacitated undirected graph is input.
Keyword (in Japanese) (See Japanese page) 
(in English) Source location problem / $k$-Edge-connected component / Edge-connectivity / Dynamic programming / / / /  
Reference Info. IEICE Tech. Rep., vol. 105, no. 634, CAS2005-122, pp. 25-29, March 2006.
Paper # CAS2005-122 
Date of Issue 2006-02-28 (CAS, SIP, CS) 
ISSN Print edition: ISSN 0913-5685
Download PDF

Conference Information
Committee CAS SIP CS  
Conference Date 2006-03-06 - 2006-03-07 
Place (in Japanese) (See Japanese page) 
Place (in English) Univ of Ryukyu 
Topics (in Japanese) (See Japanese page) 
Topics (in English) Network processors, signal processing for communications, coding theory, etc. 
Paper Information
Registration To CAS 
Conference Code 2006-03-CAS-SIP-CS 
Language English (Japanese title is available) 
Title (in Japanese) (See Japanese page) 
Sub Title (in Japanese) (See Japanese page) 
Title (in English) Maximum-Cover Source-Location Problem with Objective Edge-Connectivity Three 
Sub Title (in English)  
Keyword(1) Source location problem  
Keyword(2) $k$-Edge-connected component  
Keyword(3) Edge-connectivity  
Keyword(4) Dynamic programming  
Keyword(5)  
Keyword(6)  
Keyword(7)  
Keyword(8)  
1st Author's Name Kenya Sugihara  
1st Author's Affiliation Kyoto University (Kyoto Univ.)
2nd Author's Name Hiro Ito  
2nd Author's Affiliation Kyoto University (Kyoto Univ.)
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 ()
Speaker Author-1 
Date Time 2006-03-07 11:45:00 
Presentation Time 25 minutes 
Registration for CAS 
Paper # CAS2005-122, SIP2005-168, CS2005-115 
Volume (vol) vol.105 
Number (no) no.634(CAS), no.636(SIP), no.638(CS) 
Page pp.25-29 
#Pages
Date of Issue 2006-02-28 (CAS, SIP, CS) 


[Return to Top Page]

[Return to IEICE Web Page]


The Institute of Electronics, Information and Communication Engineers (IEICE), Japan