Degree-Based Spanning Tree Optimization Gabor Salamon

Подробная информация о книге «Degree-Based Spanning Tree Optimization Gabor Salamon». Сайт не предоставляет возможности читать онлайн или скачать бесплатно книгу «Degree-Based Spanning Tree Optimization Gabor Salamon»

Gabor Salamon - «Degree-Based Spanning Tree Optimization»

О книге

We consider several spanning tree optimization problems all having a measure function which depends only on the degrees of the resulting spanning tree. In addition, all investigated problems are generalizations of the Hamiltonian Path problem and so are NP-hard. As we cannot expect exact polynomial-time solutions, we use the approach of approximation algorithms. We look for a suboptimal solution in polynomial time and prove that it is not farther from the optimal one than a given approximation factor. Beside algorithmic aspects, we also consider the number of spanning tree leaves from a bit more theoretical point of view. We investigate how different graph vulnerability parameters, namely scattering number and cut-asymmetry, are related to the number of spanning tree leaves and that of independent spanning tree leaves. Some of our results are applied for the analysis of the Maximum Internal Spanning Tree problem, while some others give connection to the theory of hamiltonicity.... Это и многое другое вы найдете в книге Degree-Based Spanning Tree Optimization (Gabor Salamon)

Полное название книги Gabor Salamon Degree-Based Spanning Tree Optimization
Автор Gabor Salamon
Ключевые слова математика, общие вопросы математики
Категории Образование и наука, Математика
ISBN 9783659288654
Издательство
Год 2012
Название транслитом degree-based-spanning-tree-optimization-gabor-salamon
Название с ошибочной раскладкой degree-based spanning tree optimization gabor salamon