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.

Management, Computer networks, Information systems

---

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.

Methods, Analysis, Algorithms, Problem solving, Algorithm

---

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.

Operations Research, Case studies, Graphic methods, Combinatorial analysis

Similar abstracts:

• Abstracts: The maximum absolute deviation measure in location problems on networks. Optimization methods for the planning of rapid transit systems
• Abstracts: Firestone seeks new crisis team after old one leaves in frustration. U.S. ad agencies shift to overdrive to pursue Chrysler
• Abstracts: A note on AHP group consistency for the row geometric mean priorization procedure. Reciprocal distributions in the analytic hierarchy process
• Abstracts: Photo Opportunity. Digital technology is transforming the photo-agency business. Who wins in the Web age?
• Abstracts: Asia May Be Hit Hardest by Surge in Petroleum Prices. Region Has a Higher Dependence on Oil Than Developed Nations

This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.