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 2013-05-17 09:55
Approximation Algorithms for Packing Element-Disjoint Steiner Trees on Five Terminals
Daiki Hoshika, Eiji Miyano (Kyushu Inst. of Tech.) COMP2013-9
Abstract (in Japanese) (See Japanese page) 
(in English) In this paper we study the maximum packing element-disjoint Steiner tree
problem(element-disjoint MaxPST problem, for short). For a graph $G = (V, E)$ and a subset of vertices $Tsubseteq V$, called terminal vertices, a
Steiner tree is a connected, acyclic subgraph that contains all the terminal vertices. The goal of the element-disjoint MaxPST problem is
to find as many element-disjoint Steiner trees as possible. In this paper, we show that there is a 2-approximation algorithm for the element-disjoint MaxPST problem if the number of terminal vertices is at most 5.
Keyword (in Japanese) (See Japanese page) 
(in English) Steiner trees / packing / element-disjoint / approximation algorithms / / / /  
Reference Info. IEICE Tech. Rep., vol. 113, no. 50, COMP2013-9, pp. 7-12, May 2013.
Paper # COMP2013-9 
Date of Issue 2013-05-10 (COMP) 
ISSN Print edition: ISSN 0913-5685  Online edition: ISSN 2432-6380
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 COMP2013-9

Conference Information
Committee COMP IPSJ-AL  
Conference Date 2013-05-17 - 2013-05-18 
Place (in Japanese) (See Japanese page) 
Place (in English) Otaru University of Commerce 
Topics (in Japanese) (See Japanese page) 
Topics (in English)  
Paper Information
Registration To COMP 
Conference Code 2013-05-COMP-AL 
Language Japanese 
Title (in Japanese) (See Japanese page) 
Sub Title (in Japanese) (See Japanese page) 
Title (in English) Approximation Algorithms for Packing Element-Disjoint Steiner Trees on Five Terminals 
Sub Title (in English)  
Keyword(1) Steiner trees  
Keyword(2) packing  
Keyword(3) element-disjoint  
Keyword(4) approximation algorithms  
1st Author's Name Daiki Hoshika  
1st Author's Affiliation Kyushu Institute of Technology (Kyushu Inst. of Tech.)
2nd Author's Name Eiji Miyano  
2nd Author's Affiliation Kyushu Institute of Technology (Kyushu Inst. of Tech.)
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 ()
Date Time 2013-05-17 09:55:00 
Presentation Time 25 
Registration for COMP 
Paper # IEICE-COMP2013-9 
Volume (vol) IEICE-113 
Number (no) no.50 
Page pp.7-12 
#Pages IEICE-6 
Date of Issue IEICE-COMP-2013-05-10 

[Return to Top Page]

[Return to IEICE Web Page]

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