The shortest-network problem
The Steiner problem asks for the shortest network of line segments that will interconnect a set of given points. The Steiner problem cannot be solved by simply drawing lines between the given points, but it can be solved by adding new ones, called Steiner points, that serve as junctions in a shortest network. To determine the location and number of Steiner points, mathematicians and computer scientists have developed algorithms, or precise procedures. Yet even the best of these algorithms running on the fastest computers cannot provide a solution for a large set of given points because the time it would take to solve such a problem is impractically long. Furthermore, the Steiner problem belongs to a class of problem for which many computer scientists now believe an efficient algorithm may never be found. Approximate solutions to the shortest-network problem are computed routinely for numerous applications, among them designing integrated circuits, determining the evolutionary tree of a group of organisms and minimizing materials used for networks of telephone lines, pipelines and roadways.
- OSTI ID:
- 6845773
- Journal Information:
- Scientific American; (USA), Journal Name: Scientific American; (USA) Vol. 260:1; ISSN SCAMA; ISSN 0036-8733
- Country of Publication:
- United States
- Language:
- English
Similar Records
Shortest path in complete bipartite digraph problem and it applications
Characterizations of naturally submodular graphs: A polynomially solvable class of TSP