The dynamic predicate stashing copy problem and the Steiner problem in graphs

Article Abstract:

A new study investigates the dynamic predicate stashing copy problem transformed to the Steiner problem in graphs.

User Contributions:

Comment about this article or add new information about this topic:

Comment:  (50-4000 characters)

Name:

E-mail:

Security Code:

Solving group Steiner problems as Steiner problems

Article Abstract:

A known but neglected transformation of the group Steiner problem (GSP) to the Steiner problem in graphs (SPG) is investigated. A standard for future algorithms is set by the proposed solutions.

User Contributions:

Comment about this article or add new information about this topic:

Comment:  (50-4000 characters)

Name:

E-mail:

Security Code:

The partial sum criterion for Steiner trees in graphs and shortest paths

Article Abstract:

An algorithm for solving the minmax Steiner tree problem in graphs (SPG) in O(/E/) time where E is the set of edges in the graph is introduced. The algorithm combines two existing procedures for solving the bottleneck problems of the shortest path and spanning tree types, respectively. Likewise, an O(n3) algorithm that obtains the partial sum shortest paths for an undirected graph and an O(/E? + n log n) algorithm for solving single-node two-sum shortest path problems are described.

User Contributions:

Comment about this article or add new information about this topic:

Comment:  (50-4000 characters)

Name:

E-mail:

Security Code: