Paper Info
Title
The dynamic predicate stashing copy problem and the Steiner problem in graphs
Abstract
The Dynamic Predicate Stashing Copy Problem (DPSCP) is a problem about managing an information system in a network of computers. Information is stashed from a server computer to a set of client computers. Each client has specified a maximum lifetime of the information stashed on his computer. The problem is to find a minimum cost refresh policy during a finite period of time. We transform the DPSCP to the well known Steiner Problem in Graphs and we compare this approach with a known solution method.
Year
DOI
Venue
2000
10.1016/S0377-2217(99)00223-4
European Journal of Operational Research
Keywords
Field
DocType
Network programming,Communication,Steiner problem in graphs
Information system,Graph,Client,Computer science,Steiner tree problem,Server,Theoretical computer science,Predicate (grammar),Computer network programming
Journal
Volume
Issue
ISSN
125
3
0377-2217
Citations 
PageRank 
References 
0
0.34
4
Authors
3
Name
Order
Citations
PageRank
S. Marsman100.34
C. W. Duin216815.17
A. Volgenant357366.07