Polynomial algorithms to finite Veber problem for a tree network (Q1176800)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Polynomial algorithms to finite Veber problem for a tree network |
scientific article; zbMATH DE number 12521
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomial algorithms to finite Veber problem for a tree network |
scientific article; zbMATH DE number 12521 |
Statements
Polynomial algorithms to finite Veber problem for a tree network (English)
0 references
25 June 1992
0 references
This paper presents a polynomial algorithm to a finite Veber problem for a tree network, and the space and time complexity of the algorithm are estimated. For special kinds of graphs the space and time complexity can be reduced. The worked out algorithms and their computer codes can be used for synthesis and development control of oil deposit transportation and communicaton networks.
0 references
polynomial algorithms
0 references
Veber problem
0 references
tree network
0 references
complexity
0 references
