{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:48:31Z","timestamp":1759063711055,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540241317"},{"type":"electronic","value":"9783540305514"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30551-4_67","type":"book-chapter","created":{"date-parts":[[2010,7,13]],"date-time":"2010-07-13T18:15:37Z","timestamp":1279044937000},"page":"778-792","source":"Crossref","is-referenced-by-count":13,"title":["Efficient Algorithms for the Hotlink Assignment Problem: The Worst Case Search"],"prefix":"10.1007","author":[{"given":"Artur Alves","family":"Pessoa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eduardo Sany","family":"Laber","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cr\u00edston","family":"de Souza","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"67_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/978-3-540-24587-2_9","volume-title":"Algorithms and Computation","author":"O. Gerstel","year":"2003","unstructured":"Gerstel, O., Kutten, S., Matichin, R., Peleg, D.: Hotlink enhancement algorithms for web directories. In: Ibaraki, T., Katoh, N., Ono, H. (eds.) ISAAC 2003. LNCS, vol.\u00a02906, pp. 68\u201377. Springer, Heidelberg (2003)"},{"key":"67_CR2","doi-asserted-by":"crossref","unstructured":"Perkowitz, M., Etzioni, O.: Towards adaptive Web sites: conceptual framework and case study. In: Computer Networks, Amsterdam, Netherlands, vol.\u00a031, pp. 1245\u20131258 (1999)","DOI":"10.1016\/S1389-1286(99)00017-1"},{"key":"67_CR3","doi-asserted-by":"crossref","unstructured":"Bose, P., Kranakis, E., Krizanc, D., Martin, M.V., Czyzowicz, J., Pelc, A., Gasieniec, L.: Strategies for hotlink assignments. In: International Symposium on Algorithms and Computation, pp. 23\u201334 (2000)","DOI":"10.1007\/3-540-40996-3_3"},{"key":"67_CR4","doi-asserted-by":"crossref","unstructured":"Fuhrmann, S., Krumke, S.O., Wirth, H.C.: Multiple hotlink assignment. In: Proceedings of the Twenty-Seventh International Workshop on Graph- Theoretic Concepts in Computer Science (2001)","DOI":"10.1007\/3-540-45477-2_18"},{"key":"67_CR5","doi-asserted-by":"crossref","unstructured":"Kranakis, E., Krizanc, D., Shende, S.: Approximate hotlink assignment. In: ISAAC: 12th International Symposium on Algorithms and Computation (2001)","DOI":"10.1007\/3-540-45678-3_64"},{"key":"67_CR6","first-page":"93","volume":"1","author":"J. Czyzowicz","year":"2003","unstructured":"Czyzowicz, J., Kranakis, E., Krizanc, D., Pelc, A., Martin, M.V.: Enhancing hyperlink structure for improving web performance. Journal of Web Engineering\u00a01, 93\u2013127 (2003)","journal-title":"Journal of Web Engineering"},{"key":"67_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/978-3-540-45078-8_24","volume-title":"Algorithms and Data Structures","author":"P. Matichin","year":"2003","unstructured":"Matichin, P.: Approximation algorithm for hotlink assignments in web directories. In: Dehne, F., Sack, J.-R., Smid, M. (eds.) WADS 2003. LNCS, vol.\u00a02748, pp. 271\u2013280. Springer, Heidelberg (2003)"},{"key":"67_CR8","unstructured":"Pessoa, A., Laber, E., Souza, C.: Efficient implementation of hotlink assignment algorithms for web sites. In: Proceedings of ALENEX (2004)"},{"key":"67_CR9","doi-asserted-by":"crossref","unstructured":"Matichin, P.: Approximation algorithm for hotlink assignment in the greedy model. In: SIROCCO 2004:11th Colloquium on Structural Information and Communication Comple (2004)","DOI":"10.1007\/978-3-540-27796-5_21"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30551-4_67","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,27]],"date-time":"2023-01-27T21:08:06Z","timestamp":1674853686000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-30551-4_67"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540241317","9783540305514"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30551-4_67","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}