Efficiency of Algorithms for Solution of Network Problems with Tree-Like Data Structure

Authors:
F. A. Sharifov
Affiliations:
V. M. Glushkov Institute of Cybernetics, National Academy of Sciences of Ukraine, Kiev, Ukraine
Venue:
Cybernetics and Systems Analysis
Year:
2003

Citing 2
Cited 0

A faster strongly polynomial minimum cost flow algorithm

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
A strongly polynomial algorithm for the transportation problem

Mathematical Programming: Series A and B

Quantified Score

Hi-index	0.00

Visualization

Abstract

It is shown that the running time of a special simplex algorithm for solution of practical network problems is improved if a tree-like structure is used to store data.