In this paper the problem of estimating the importance of each of the characteristics of steganographic algorithms is solved. The resulting estimates are used in the analysis of the existing algorithms for information embedding and multiobjective choice of the best algorithm. The technique allows providing an equally weighted algorithms estimation, and also considers the importance of coefficients of characteristics.
The paper proposes a method, algorithms and its implementations using dominance rules for minimizing the total tardiness on a single machine based on shortest Hamiltonian path in a arbitrary graph that improve the efficiency and not reduce the execution time. Metrics for evaluating the effectiveness of the dominance rules are proposed. The experimental results of algorithms are developed that justify the effectiveness of the proposed modifications by getting local optimal solutions during procedure.