{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T04:35:37Z","timestamp":1648874137400},"reference-count":13,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2000,9,1]],"date-time":"2000-09-01T00:00:00Z","timestamp":967766400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2000,9]]},"DOI":"10.1016\/s0377-2217(99)00223-4","type":"journal-article","created":{"date-parts":[[2003,4,5]],"date-time":"2003-04-05T00:21:01Z","timestamp":1049502061000},"page":"526-534","source":"Crossref","is-referenced-by-count":0,"title":["The dynamic predicate stashing copy problem and the Steiner problem in graphs"],"prefix":"10.1016","volume":"125","author":[{"given":"S","family":"Marsman","sequence":"first","affiliation":[]},{"given":"C.W","family":"Duin","sequence":"additional","affiliation":[]},{"given":"A","family":"Volgenant","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(99)00223-4_BIB1","doi-asserted-by":"crossref","unstructured":"Alonso, R., Barbar\u00e1, D., Cova, L., 1990. Using stashing to increase node autonomy in distributed file systems. In: Proceedings of the Ninth Symposium on Reliable Distributed Systems, Huntsville, AL, IEEE-CS Press, pp. 12\u201321","DOI":"10.1109\/RELDIS.1990.93947"},{"key":"10.1016\/S0377-2217(99)00223-4_BIB2","unstructured":"Cova, L., 1990. Resource management in federated computing environment. Dissertation, Dept. of Computer Science, Princeton University, CS-TR-282-90"},{"key":"10.1016\/S0377-2217(99)00223-4_BIB3","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1002\/net.3230010302","article-title":"The Steiner problem in graphs","volume":"1","author":"Dreyfus","year":"1972","journal-title":"Networks"},{"key":"10.1016\/S0377-2217(99)00223-4_BIB4","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1002\/net.3230190506","article-title":"Reduction tests for the Steiner problem in graphs","volume":"19","author":"Duin","year":"1989","journal-title":"Networks"},{"key":"10.1016\/S0377-2217(99)00223-4_BIB5","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0167-6377(89)90005-9","article-title":"An edge elimination test for the Steiner problem in graphs","volume":"8","author":"Duin","year":"1989","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0377-2217(99)00223-4_BIB6","unstructured":"Duin, C.W., 1994. Steiner's problem in graphs. Ph.D. Thesis, University of Amsterdam"},{"key":"10.1016\/S0377-2217(99)00223-4_BIB7","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1090\/dimacs\/040\/06","article-title":"Reducing the graphical Steiner problem with a sensitivity test","volume":"40","author":"Duin","year":"1998","journal-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science"},{"key":"10.1016\/S0377-2217(99)00223-4_BIB8","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1002\/net.3230010203","article-title":"Steiner's problems in graphs and its implications","volume":"1","author":"Hakimi","year":"1971","journal-title":"Networks"},{"key":"10.1016\/S0377-2217(99)00223-4_BIB9","doi-asserted-by":"crossref","unstructured":"Hwang, F.K., Richards, D.S., Winter, P., 1992. The Steiner problem. Annals of Discrete Mathematics 53","DOI":"10.1016\/0166-218X(92)90178-D"},{"key":"10.1016\/S0377-2217(99)00223-4_BIB10","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0012-365X(78)90011-0","article-title":"A characterization of the minimum cycle mean in a digraph","volume":"23","author":"Karp","year":"1978","journal-title":"Discrete Mathematics"},{"key":"10.1016\/S0377-2217(99)00223-4_BIB11","doi-asserted-by":"crossref","unstructured":"Koch, J., Martin, A., 1998. Solving Steiner tree problems in graphs to optimality. Networks 32, 207\u2013232","DOI":"10.1002\/(SICI)1097-0037(199810)32:3<207::AID-NET5>3.0.CO;2-O"},{"key":"10.1016\/S0377-2217(99)00223-4_BIB12","doi-asserted-by":"crossref","first-page":"681","DOI":"10.1002\/net.3230230806","article-title":"The dynamic predicate stashing copy problem","volume":"23","author":"Sans\u00f3","year":"1993","journal-title":"Networks"},{"key":"10.1016\/S0377-2217(99)00223-4_BIB13","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1287\/opre.46.3.305","article-title":"Managing redundancy in a distributed computer network: A state transition approach","volume":"46","author":"Walker","year":"1998","journal-title":"Operations Research"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221799002234?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221799002234?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,21]],"date-time":"2019-04-21T10:53:13Z","timestamp":1555843993000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221799002234"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,9]]},"references-count":13,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2000,9]]}},"alternative-id":["S0377221799002234"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(99)00223-4","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2000,9]]}}}