IMI-BAS BAS
 

BulDML at Institute of Mathematics and Informatics >
ITHEA >
International Journal ITA >
2003 >
Volume 10 Number 4 >

Please use this identifier to cite or link to this item: http://hdl.handle.net/10525/963

Title: Differential Balanced Trees and (0,1) Matrices
Authors: Sahakyan, Hasmik
Aslanyan, Levon
Keywords: Search
Balanced Trees
(0,1)-Matrices
Greedy Algorithm
Issue Date: 2003
Publisher: Institute of Information Theories and Applications FOI ITHEA
Abstract: Links and similarities between the combinatorial optimization problems and the hierarchical search algorithms are discussed. One is the combinatorial greedy algorithm of step-by-step construction of the column-constraint (0,1) matrices with the different rows. The second is the base search construction of databases, - the class of the well known weight-balanced binary trees. Noted, that in some approximation each of the above problems might be interpreted in terms of the second problem. The constraints in matrices imply the novel concept of a differential balance in hierarchical trees. The obtained results extend the knowledge for balanced trees and prove that the known greedy algorithm for matrices is applicable in the world of balanced trees providing optimization on trees in layers.
Description: * The research was supported by INTAS 00-397 and 00-626 Projects.
URI: http://hdl.handle.net/10525/963
ISSN: 1313-0463
Appears in Collections:Volume 10 Number 4

Files in This Item:

File Description SizeFormat
ijita10-4-p01.pdf73.66 kBAdobe PDFView/Open

 



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

 

Valid XHTML 1.0!   Creative Commons License DSpace Software Copyright © 2002-2009  The DSpace Foundation - Feedback