{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T05:35:09Z","timestamp":1743053709840,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540229247"},{"type":"electronic","value":"9783540278665"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27866-5_102","type":"book-chapter","created":{"date-parts":[[2010,9,16]],"date-time":"2010-09-16T20:20:42Z","timestamp":1284668442000},"page":"776-783","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Placement of Nodes in an Adaptive Distributed Multimedia Server"],"prefix":"10.1007","author":[{"given":"Bal\u00e1zs","family":"Goldschmidt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tibor","family":"Szkaliczki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L\u00e1szl\u00f3","family":"B\u00f6sz\u00f6rm\u00e9nyi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"102_CR1","unstructured":"Apple Computer, Inc. QuickTime Streaming Server: Darwin Streaming Server: Administrator\u2019s Guide (2002), http:\/\/developer.apple.com\/darwin\/projects\/streaming\/"},{"key":"102_CR2","unstructured":"Helix Community: Helix Universal Server Administration Guide (2002), https:\/\/www.helixcommunity.org\/2002\/intro\/platform"},{"key":"102_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/978-3-540-45213-3_11","volume-title":"Modular Programming Languages","author":"R. Tusch","year":"2003","unstructured":"Tusch, R.: Towards an adaptive distributed multimedia streaming server architecture based on service-oriented components. In: B\u00f6sz\u00f6rm\u00e9nyi, L., Schojer, P. (eds.) JMLC 2003. LNCS, vol.\u00a02789, pp. 78\u201387. Springer, Heidelberg (2003)"},{"key":"102_CR4","first-page":"49","volume":"1","author":"R. Tusch","year":"2004","unstructured":"Tusch, R., B\u00f6sz\u00f6rm\u00e9nyi, L., Goldschmidt, B., Hellwagner, H., Schojer, P.: Offensive and Defensive Adaptation in Distributed Multimedia Systems. Computer Science and Information Systems (ComSIS)\u00a01, 49\u201377 (2004)","journal-title":"Computer Science and Information Systems (ComSIS)"},{"key":"102_CR5","unstructured":"Goldschmidt, B., Szkaliczki, T., B\u00f6sz\u00f6rm\u00e9nyi, L.: Placement of Nodes in an Adaptive Distributed Multimedia Server. Technical Report TR\/ITEC\/04\/2.06, Institute of Information Technology, Klagenfurt University, Klagenfurt, Austria (2004)"},{"key":"102_CR6","unstructured":"Steen, M., Homburg, P., Tannenbaum, A.S.: Globe: A wide-area distributed system. IEEE Concurrency (1999)"},{"key":"102_CR7","unstructured":"Li, B., Golin, M., Italiano, G., Deng, X., Sohraby, K.: On the optimal placement of web proxies in the internet. In: Proceedings of the Conference on Computer Communications, IEEE Infocom (1999)"},{"key":"102_CR8","unstructured":"Qiu, L., Padmanabhan, V.N., Voelker, G.M.: On the placement of web server replicas. In: INFOCOM, pp. 1587\u20131596 (2001)"},{"key":"102_CR9","first-page":"119","volume-title":"Discrete Location Theory","author":"G. Cornuejols","year":"1990","unstructured":"Cornuejols, G., Nemhauser, G.L., Wolsey, L.A.: The uncapacitated facility location problem. In: Mirchandani, P., Francis, R. (eds.) Discrete Location Theory, pp. 119\u2013171. John Wiley and Sons, New York (1990)"},{"key":"102_CR10","doi-asserted-by":"crossref","unstructured":"Shmoys, D., Tardos, E., Aardal, K.: Approximation algorithms for facility location problems. In: Proceedings of the 29th ACM Symposium on Theory of Computing, pp. 265\u2013274 (1997)","DOI":"10.1145\/258533.258600"},{"key":"102_CR11","doi-asserted-by":"crossref","unstructured":"Charikar, M., Guha, S.: Improved combinatorial algorithms for the facility location and k-median problems. In: IEEE Symposium on Foundations of Computer Science, pp. 378\u2013388 (1999)","DOI":"10.1109\/SFFCS.1999.814609"},{"key":"102_CR12","doi-asserted-by":"crossref","unstructured":"Mahdian, M., Ye, Y., Zhang, J.: Improved approximation algorithms for metric facility location problems. In: Proceedings of 5th International Workshop on Approximation Algorithms for Combinatorial Optimization (2002)","DOI":"10.1007\/3-540-45753-4_20"},{"key":"102_CR13","unstructured":"Dvorett, J.: Compatibility-based genetic algorithm: A new approach to the pmedian problem. In: Informs Fall 1999 Meeting (1999)"},{"key":"102_CR14","volume-title":"Swarm Intelligence","author":"J. Kennedy","year":"2001","unstructured":"Kennedy, J., Eberhardt, R.C.: Swarm Intelligence. Morgan Kaufmann, San Francisco (2001)"},{"key":"102_CR15","unstructured":"Goldschmidt, B., Tusch, R., B\u00f6sz\u00f6rm\u00e9nyi, L.: A corba-based middleware for an adaptive streaming server. Parallel and Distributed Computing Practices, Special issue on Dapsys 2002 (2003)"},{"key":"102_CR16","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/978-1-4615-1167-0_17","volume-title":"4th DAPSYS, Austrian-Hungarian Workshop on Distributed and Parallel Systems","author":"B. Goldschmidt","year":"2002","unstructured":"Goldschmidt, B., Tusch, R., B\u00f6sz\u00f6rm\u00e9nyi, L.: A mobile agent-based infrastructure for an adaptive multimedia server. In: 4th DAPSYS, Austrian-Hungarian Workshop on Distributed and Parallel Systems, pp. 141\u2013148. Kluwer Academic Publishers, Dordrecht (2002)"},{"key":"102_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1199","DOI":"10.1007\/978-3-540-45209-6_161","volume-title":"Euro-Par 2003 Parallel Processing","author":"B. Goldschmidt","year":"2003","unstructured":"Goldschmidt, B., L\u00e1szl\u00f3, Z.: A proxy placement algorithm for the adaptive multimedia server. In: Kosch, H., B\u00f6sz\u00f6rm\u00e9nyi, L., Hellwagner, H. (eds.) Euro-Par 2003. LNCS, vol.\u00a02790, pp. 1199\u20131206. Springer, Heidelberg (2003)"},{"key":"102_CR18","unstructured":"Davis, L. (ed.): Handbook of Genetic Algorithms. Van Nostrand Reinhold (1991)"},{"issue":"4598","key":"102_CR19","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science\u00a0220(4598), 671\u2013680 (1983)","journal-title":"Science"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2004 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27866-5_102","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T21:55:29Z","timestamp":1740520529000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27866-5_102"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540229247","9783540278665"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27866-5_102","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}