{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:32:26Z","timestamp":1725661946767},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642282546"},{"type":"electronic","value":"9783642282553"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-28255-3_10","type":"book-chapter","created":{"date-parts":[[2012,2,22]],"date-time":"2012-02-22T14:39:25Z","timestamp":1329921565000},"page":"85-92","source":"Crossref","is-referenced-by-count":5,"title":["Decentralized Approximation Algorithm for Data Placement Problem in Content Delivery Networks"],"prefix":"10.1007","author":[{"given":"Maciej","family":"Drwal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jerzy","family":"J\u00f3zefczyk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","doi-asserted-by":"publisher","first-page":"3861","DOI":"10.1016\/j.cor.2007.02.005","volume":"35","author":"T. Bektas","year":"2008","unstructured":"Bektas, T., Cordeau, J., Erkut, E., Laporte, G.: Exact Algorithms for the Joint Object Placement and Request Routing Problem in Content Distribution Networks. Computers & Operations Research\u00a035, 3861\u20133884 (2008)","journal-title":"Computers & Operations Research"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Bickson, D., Dolev, D., Shental, O., Siegel, P.H., Wolf, J.K.: Gaussian Belief Propagation Based Multiuser Detection. In: IEEE International Symposium on Information Theory, pp. 1878\u20131882 (2008)","DOI":"10.1109\/ISIT.2008.4595314"},{"key":"10_CR3","unstructured":"Drwal, M., Jozefczyk, J.: Load Balanced Location-Routing Problem in Content Distribution Networks. In: 23rd International Conference on Systems Research, Informatics and Cybernetics, pp. 34\u201338 (2011)"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Jacobson, V., et al.: Networking Named Content. In: 5th International Conference on Emerging Networking Experiments and Technologies, pp. 1\u201312 (2009)","DOI":"10.1145\/1658939.1658941"},{"issue":"2","key":"10_CR5","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1145\/375827.375845","volume":"48","author":"K. Jain","year":"2001","unstructured":"Jain, K., Vazirani, V.: Approximation Algorithms for Metric Facility Location and k-median Problems Using the Primal-Dual Schema and Lagrangian Relaxation. Journal of the ACM\u00a048(2), 274\u2013296 (2001)","journal-title":"Journal of the ACM"},{"key":"10_CR6","unstructured":"Knuth, D.E.: The Art of Computer Programming. Seminumerical Algorithms, vol.\u00a02, Adison Wesley, Reading (1997)"},{"issue":"2","key":"10_CR7","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1145\/1461928.1461944","volume":"52","author":"T. Leighton","year":"2009","unstructured":"Leighton, T.: Improving Performance on the Internet. Communications of the ACM\u00a052(2), 44\u201351 (2009)","journal-title":"Communications of the ACM"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Lin, J.H., Vitter, J.S.: e-Approximations with Minimum Packing Constraint Violation. In: 24th ACM Symposium on Theory of Computing, pp. 771\u2013782 (1992)","DOI":"10.1145\/129712.129787"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Moscibroda, T., Wattenhofer, R.: Facility Location: Distributed Approximation. In: 24th ACM Symposium on Principles of Distribued Computing, pp. 108\u2013117 (2005)","DOI":"10.1145\/1073814.1073834"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Mosk-Aoyama, D., Roughgarden, T., Shah, D.: Fully Distributed Algorithms for Convex Optimization Problems. SIAM Journal on Optimization\u00a020(6) (2010)","DOI":"10.1137\/080743706"},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"Sherali, H.D., Adams, W.P.: A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems. Kluwer Academic Publishers (1999)","DOI":"10.1007\/978-1-4757-4388-3"},{"key":"10_CR12","unstructured":"UFLP Benchmark Library, \n                    \n                      http:\/\/math.nsc.ru\/AP\/benchmarks\/english.html"},{"issue":"1","key":"10_CR13","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1137\/1038003","volume":"38","author":"L. Vandenberghe","year":"1996","unstructured":"Vandenberghe, L., Boyd, S.: Semidefinite Programming. SIAM Review\u00a038(1), 49\u201395 (1996)","journal-title":"SIAM Review"}],"container-title":["IFIP Advances in Information and Communication Technology","Technological Innovation for Value Creation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-28255-3_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T17:53:52Z","timestamp":1558374832000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-28255-3_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642282546","9783642282553"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-28255-3_10","relation":{},"ISSN":["1868-4238","1861-2288"],"issn-type":[{"type":"print","value":"1868-4238"},{"type":"electronic","value":"1861-2288"}],"subject":[],"published":{"date-parts":[[2012]]}}}