{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T07:35:21Z","timestamp":1725521721466},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540897361"},{"type":"electronic","value":"9783540897378"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-89737-8_5","type":"book-chapter","created":{"date-parts":[[2008,12,11]],"date-time":"2008-12-11T04:13:24Z","timestamp":1228968804000},"page":"51-56","source":"Crossref","is-referenced-by-count":0,"title":["Back-Edge Heuristic for Efficient Data Distribution in Grid Systems"],"prefix":"10.1007","author":[{"given":"Marek","family":"Ciglan","sequence":"first","affiliation":[]},{"given":"Ladislav","family":"Hluchy","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","unstructured":"Cherkasova, L.: Optimizing the Reliable Distribution of Large Files within CDNs. In: Proceedings of the 10th IEEE Symposium on Computers and Communications (ISCC 2005), Spain (2005) ISSN: 1530-1346, ISBN: 0-7695-2373-0"},{"key":"5_CR2","unstructured":"Cohen, B.: Incentives build robustness in BitTorrent. In: P2P Economics Workshop (2003)"},{"key":"5_CR3","unstructured":"Ganguly, S., Saxena, A., Bhatnagar, S., Izmailov, R., Banerjee, S.: Fast replication in content distribution overlays: INFOCOM 2005. In: 24th Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings IEEE, vol.\u00a04, pp. 2246\u20132256 (2005) ISSN: 0743-166X, ISBN: 0-7803-8968-9, doi: 10.1109\/INFCOM. 2005.1498512"},{"key":"5_CR4","unstructured":"Jain, K., Mahdian, M., Salavatipour, M.R.: Packing Steiner trees. In: 14th ACM-SIAM Symposium on Discrete Algorithms (SODA) (2003) ISBN:0-89871-538-5"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Kruskal, J.B.: On the shortest spanning subtree of a graph and the traveling salesman problem. In: Proc. American Math. Society, vol. 7, pp. 48\u201350 (1956) doi:10.2307\/2033241","DOI":"10.2307\/2033241"},{"key":"5_CR6","doi-asserted-by":"publisher","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","volume":"36","author":"R.C. Prim","year":"1957","unstructured":"Prim, R.C.: Shortest connection networks and some generalizations. Bell System Technical R\u00a036, 1389\u20131401 (1957)","journal-title":"Bell System Technical R"},{"key":"5_CR7","unstructured":"Wu, Y., Chou, P.A., Jain, K.: A comparison of network coding and tree packing. In: Proceedings of International Symposium on Information Theory. ISIT 2004 (2004) ISBN: 0-7803-8280-3"},{"key":"5_CR8","unstructured":"Ciglan, M.: Replica delivery optimization and content synchronization in data grids, dissertation thesis, Institute of informatics, Slovak academy of sciences (2008)"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing and Internet Technology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-89737-8_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,4]],"date-time":"2019-03-04T06:28:51Z","timestamp":1551680931000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-89737-8_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540897361","9783540897378"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-89737-8_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}