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 2011-06-30 11:05
Partitioning Trees with Supply, Demand and Edge-Capacity
Masaki Kawabata, Takao Nishizeki (Kwansei Gakuin Univ.) COMP2011-17
Abstract (in Japanese) (See Japanese page) 
(in English) Let T be a given tree. Each vertex of T is either a supply vertex or a demand vertex, and is assigned a positive number, called the supply or demand. Each demand vertex v must be supplied an amount of ``power," equal to the demand of v, from exactly one supply vertex through edges in T. Each edge is assigned a positive number called the capacity. One wishes to partition T into subtrees by deleting edges from T so that each subtree contains exactly one supply vertex whose supply is no less than the sum of all demands in the subtree and the power flow through each edge is no more than capacity of the edge. The ``partition problem" is a decision problem to ask whether T has such a partition. The ``maximum partition problem" is an optimization version of the partition problem. In this paper, we give three algorithms for the problems. First is a linear-time algorithm for the partition problem. Second is a pseudo-polynomial-time algorithm for the maximum partition problem. Third is a fully polynomial-time approximation scheme (FPTAS) for the maximum partition problem.
Keyword (in Japanese) (See Japanese page) 
(in English) tree / partition problem / maximum partition problem / supply vertex / demand vertex / edge-capacity / algorithm / approximation  
Reference Info. IEICE Tech. Rep., vol. 111, no. 113, COMP2011-17, pp. 9-16, June 2011.
Paper # COMP2011-17 
Date of Issue 2011-06-23 (COMP) 
ISSN Print edition: ISSN 0913-5685    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 COMP2011-17

Conference Information
Committee COMP  
Conference Date 2011-06-30 - 2011-06-30 
Place (in Japanese) (See Japanese page) 
Place (in English) Hiroshima Univ. 
Topics (in Japanese) (See Japanese page) 
Topics (in English)  
Paper Information
Registration To COMP 
Conference Code 2011-06-COMP 
Language English (Japanese title is available) 
Title (in Japanese) (See Japanese page) 
Sub Title (in Japanese) (See Japanese page) 
Title (in English) Partitioning Trees with Supply, Demand and Edge-Capacity 
Sub Title (in English)  
Keyword(1) tree  
Keyword(2) partition problem  
Keyword(3) maximum partition problem  
Keyword(4) supply vertex  
Keyword(5) demand vertex  
Keyword(6) edge-capacity  
Keyword(7) algorithm  
Keyword(8) approximation  
1st Author's Name Masaki Kawabata  
1st Author's Affiliation Kwansei Gakuin University (Kwansei Gakuin Univ.)
2nd Author's Name Takao Nishizeki  
2nd Author's Affiliation Kwansei Gakuin University (Kwansei Gakuin 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 2011-06-30 11:05:00 
Presentation Time 35 minutes 
Registration for COMP 
Paper # COMP2011-17 
Volume (vol) vol.111 
Number (no) no.113 
Page pp.9-16 
#Pages
Date of Issue 2011-06-23 (COMP) 


[Return to Top Page]

[Return to IEICE Web Page]


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