An algorithm for approximation of empirical graphs (a probabilistic approach)

An iterative projectionless algorithm is proposed for construction of the probabilistic problem of approximating weighed graphs. The algorithm operates by extensive use of the structure of the feasible region.