Dynamic Programming and Greedy Algorithm Strategy for Solving Several Classes of Graph Optimization Problems

Abstract

This article is devoted to the development of the scientific methods of dynamic programming and greedy algorithms to expose the software of innovation methods of mathematical and computational approaches in advancing modern science and teaching. The tools applied in this development are based on the graph theory, generalized approximate dynamical programming method and greedy algorithms. The results are presented on both the fundamental and applied level.