Algorithms for Designing Communication Networks Using Greedy Heuristics of Various Types

EasyChair Preprint no. 3505

Abstract

We consider two frequently arising problems in the modeling of a communication network related to the construction of a graph of a communication network that satisfies certain conditions. An algorithm is proposed to which the solution of both problems related to the class of greedy algorithms can be reduced. The question of the uniqueness of the solution of the tasks is investigated. A positive result of solving the problem is obtained and sufficient conditions for uniqueness are identified. The research and development of the corresponding software are of practical importance in the design of real communication networks.

Keyphrases: graph algorithm, networks, stability

@Booklet{EasyChair:3505,
  author = {Andrew Bulynin and Boris Melnikov and Vladimir Meshchanin and Julia Terentyeva},
  title = {Algorithms for Designing Communication Networks Using Greedy Heuristics of Various Types},
  howpublished = {EasyChair Preprint no. 3505},

  year = {EasyChair, 2020}}