{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:48:59Z","timestamp":1759063739630},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540412557"},{"type":"electronic","value":"9783540409960"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-40996-3_3","type":"book-chapter","created":{"date-parts":[[2007,8,28]],"date-time":"2007-08-28T21:17:32Z","timestamp":1188335852000},"page":"23-34","source":"Crossref","is-referenced-by-count":19,"title":["Strategies for Hotlink Assignments"],"prefix":"10.1007","author":[{"given":"Prosenjit","family":"Bose","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jurek","family":"Czyzowicz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leszek","family":"G\u0105sieniec","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Evangelos","family":"Kranakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Danny","family":"Krizanc","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrzej","family":"Pelc","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Miguel","family":"Vargas Martin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,1,29]]},"reference":[{"key":"3_CR1","unstructured":"N. Abramson, \u201cInformation Theory and Coding\u201d, McGraw Hill, 1963."},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"W. Aiello, F. Chung, L. Lu, \u201cA random graph model for massive graphs\u201d. To appear in Proc. of the 32nd ACM Symp. on the Theory of Computing, 2000.","DOI":"10.1145\/335305.335326"},{"key":"3_CR3","unstructured":"J. Czyzowicz, E. Kranakis, A. Pelc, M. Vargas Martin, \u201cOptimal Assignment of Bookmarks to Web Pages\u201d, to appear."},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"M. Faloutsos, P. Faloutsos, C. Faloutsos, \u201cOn Power-Law Relationships of the Internet Topology\u201d, In proceedings of SIGCOM: IEEE Conference on Communication, 1999.","DOI":"10.1145\/316188.316229"},{"key":"3_CR5","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"M.R. Garey and D.S. Johnson, \u201cComputers and Intractability: A Guide to the Theory of NP-Completeness\u201d, Freeman and Co., New York, 1979."},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"J. M. Kleinberg, R. Kumar, P. Raghavan, S. Rajagopalan, A. S. Tomkins, \u201cThe Web as a graph: measurements, models, and methods. In Proc. of the Fifth Int. Conf. on Computing and Combinatorics\u201d, Springer-Verlag, pages 1\u201317, 1999.","DOI":"10.1007\/3-540-48686-0_1"},{"key":"3_CR7","unstructured":"D. Knuth, \u201cThe Art of Computer Programming: Volume 1, Fundamental Algorithms\u201d, Addison Wesley, 2nd ed., 1997."},{"key":"3_CR8","unstructured":"D. Knuth, \u201cThe Art of Computer Programming: Volume 3, Sorting and Searching\u201d, Addison Wesley, 3rd ed., 1998."},{"key":"3_CR9","unstructured":"B. Li, M. Golin, G. Italiano, X. Deng and K. Sohraby, \u201cOn the Optimal Placement of Web Proxies in the Internet\u201d, IEEE InfoCom\u201999, pp.1282\u20131290, 1999."},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"B. Li, X. Deng, M. Golin, and K. Sohraby, \u201cOn the Optimal Placement of Web Proxies in the Internet\u201d, 8th IFIP Conf. on High Performance Networking, 1998.","DOI":"10.1007\/978-0-387-35388-3_28"},{"key":"3_CR11","unstructured":"C. K. Zipf. \u201cHuman Behavior and the Principle of Least Effort\u201d, Reading Mass., Addison Wesley, 1949."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-40996-3_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T13:26:04Z","timestamp":1556803564000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-40996-3_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540412557","9783540409960"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-40996-3_3","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}