{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:57:32Z","timestamp":1725512252507},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540723592"},{"type":"electronic","value":"9783540723608"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-72360-8_11","type":"book-chapter","created":{"date-parts":[[2007,6,20]],"date-time":"2007-06-20T23:07:03Z","timestamp":1182380823000},"page":"124-135","source":"Crossref","is-referenced-by-count":0,"title":["Server Placement in the Presence of Competition"],"prefix":"10.1007","author":[{"given":"Pangfeng","family":"Liu","sequence":"first","affiliation":[]},{"given":"Yi-Min","family":"Chung","sequence":"additional","affiliation":[]},{"given":"Jan-Jan","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Chien-Min","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","unstructured":"Calvert, K., Zegura, E.: Gt-itm: Georgia tech internetwork topology models. \n                  \n                    http:\/\/www-static.cc.gatech.edu\/projects\/gtitm\/"},{"key":"11_CR2","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman & Co., New York (1979)"},{"issue":"4","key":"11_CR3","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1093\/comjnl\/46.4.378","volume":"46","author":"X. Jia","year":"2003","unstructured":"Jia, X., et al.: Placement of web-server proxies with consideration of read and update operations on the internet. The Computer Journal\u00a046(4), 378\u2013390 (2003)","journal-title":"The Computer Journal"},{"issue":"6","key":"11_CR4","doi-asserted-by":"publisher","first-page":"628","DOI":"10.1109\/71.932716","volume":"12","author":"K. Kalpakis","year":"2001","unstructured":"Kalpakis, K., Dasgupta, K., Wolfson, O.: Optimal placement of replicas in trees with read, write, and storage costs. IEEE Transactions on Parallel and Distributed Systems\u00a012(6), 628\u2013637 (2001)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"3","key":"11_CR5","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1137\/0137041","volume":"37","author":"O. Kariv","year":"1979","unstructured":"Kariv, O., Hakimi, S.L.: An algorithmic approach to network location problems. ii: The p-medians. SIAM J. Appl. Math.\u00a037(3), 539\u2013560 (1979)","journal-title":"SIAM J. Appl. Math."},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Ko, B.-J., Rubenstein, D.: A greedy approach to replicated content placement using graph coloring. In: SPIE ITCom Conference on Scalability and Traffic Control in IP Networks II, Boston, MA (July 2002)","DOI":"10.1117\/12.475279"},{"key":"11_CR7","unstructured":"Makhorin, A.: \n                  \n                    http:\/\/www.gnu.org\/software\/glpk\/glpk.html"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Shmoys, D.B., Tardos, E., Aardal, K.: Approximation algorithms for facility location problems (extended abstract). In: Proc. 29th ACM STOC., pp. 265\u2013274 (1997)","DOI":"10.1145\/258533.258600"},{"issue":"2","key":"11_CR9","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/0167-6377(96)00021-1","volume":"19","author":"A. Tamir","year":"1996","unstructured":"Tamir, A.: An o(pn\n                2) algorithm for the p-median and related problems on tree graphs. Operations Research Letters\u00a019(2), 59\u201364 (1996)","journal-title":"Operations Research Letters"},{"issue":"3","key":"11_CR10","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1023\/B:WWWJ.0000028183.20015.be","volume":"7","author":"O. Unger","year":"2004","unstructured":"Unger, O., Cidon, I.: Optimal content location in multicast based overlay networks with content updates. World Wide Web\u00a07(3), 315\u2013336 (2004)","journal-title":"World Wide Web"},{"key":"11_CR11","unstructured":"Waxman, B.M.: Routing of multipoint connections. pp. 347\u2013352 (1991)"}],"container-title":["Lecture Notes in Computer Science","Advances in Grid and Pervasive Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72360-8_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:30:44Z","timestamp":1605763844000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72360-8_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540723592","9783540723608"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72360-8_11","relation":{},"subject":[]}}