The dynamic predicate stashing copy problem and the Steiner problem in graphs
From MaRDI portal
Publication:1582038
DOI10.1016/S0377-2217(99)00223-4zbMath0967.90015MaRDI QIDQ1582038
Cees W. Duin, A. Volgenant, S. Marsman
Publication date: 3 September 2001
Published in: European Journal of Operational Research (Search for Journal in Brave)
90C35: Programming involving graphs or networks
90B18: Communication networks in operations research
90C27: Combinatorial optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- An edge elimination test for the Steiner problem in graphs
- The Steiner tree problem
- A characterization of the minimum cycle mean in a digraph
- Managing Redundancy in Distributed Computer Networks: A State Transition Graph Approach for the Stashing Problem
- Reduction tests for the steiner problem in grapsh
- The dynamic predicate stashing copy problem
- Steiner's problem in graphs and its implications
- The steiner problem in graphs