Towards methods of estimation of homogeneous flow in a bidirectional network: suboptimal solutions

We consider a real-world problem of constructing such a suboptimal solution of the
\nproblem of estimating homogeneous flow in a bidirectional network and guaranteeing that the network is
\nfully monitored. Unlike the problem of finding the optimal solution [1, 2], which is NP-complete [3] and
\nhas huge computational costs, the search for a suboptimal solution does not require to minimize the set M
\nof monitored network nodes. Our approach can be used for examining intelligent transportation systems
\nand creating algorithms for solving sensor location problem for a bidirectional graph (the sensors are
\nplaced in the graph nodes in order to estimate the homogeneous flow in the unmonitored part of the graph).