The dynamic predicate stashing copy problem and the Steiner problem in graphs
type: Item
instance of: scholarly article
title: The dynamic predicate stashing copy problem and the Steiner problem in graphs
zbMATH Open document ID: 0967.90015
DOI: 10.1016/S0377-2217(99)00223-4
author: S. Marsman
author: A. Volgenant
author: Cees Duin
published in: European Journal of Operational Research
publication date: 2001-09-03T00:00:00Z
Mathematics Subject Classification ID: 90B18
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 1515700
zbMATH Keywords: network programming
zbMATH Keywords: communication
zbMATH Keywords: Steiner problem in graphs
describes a project that uses: SteinLib
MaRDI profile type: Publication
cites work: The steiner problem in graphs
cites work: Reduction tests for the steiner problem in grapsh
cites work: An edge elimination test for the Steiner problem in graphs
cites work: Q4395322
cites work: Steiner's problem in graphs and its implications
cites work: The Steiner tree problem
cites work: A characterization of the minimum cycle mean in a digraph
cites work: Solving Steiner tree problems in graphs to optimality
cites work: The dynamic predicate stashing copy problem
cites work: Managing redundancy in distributed computer networks: A state transition graph approach for the stashing problem
full work available at URL: s0377-2217(99)00223-4
OpenAlex ID: W2055902343
description: scientific article; zbMATH DE number 1515700