Software implementation strategies for telecommunications problems
Simona Dinu · 2020
This paper aims to investigate graph-related telecommunication problems from a conceptual modelling point of view, based on the argument that a wide range of efficient algorithms for these computational problems can be framed within three design paradigms, namely Backtracking, Divide and Conquer and Greedy approach. First of all, such an abstract design technique represents a general problem-solving template that can be used for a broad range of problems in a large variety of applications domains, whose resolution will thus materialize in specific instances of that procedure; the procedure shall be further implemented in any programming language. Secondly, it is important because it guides the researchers in the field and facilitates the development of new and useful algorithms for other graph-structured computational problems.