|
Vector optimization of decompositions of root trees
A. A. Markov
Abstract:
We consider the decompositions of root trees with vector vertex weights. We study a problem on the minimization of the number of the decomposition under a vector constraint. We prove the insolvability of this problem in a class of generalized finite automata over trees containing algorithms of gradient type. We estimate the error of the automaton algorithm, present an algorithm that solves a problem with polynomially bounded time complexity, and obtain an estimate for the number of parts of the decomposition.
Received: 29.05.1990
Citation:
A. A. Markov, “Vector optimization of decompositions of root trees”, Diskr. Mat., 3:2 (1991), 58–68
Linking options:
https://www.mathnet.ru/eng/dm787 https://www.mathnet.ru/eng/dm/v3/i2/p58
|
Statistics & downloads: |
Abstract page: | 345 | Full-text PDF : | 131 | First page: | 1 |
|