{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T10:40:18Z","timestamp":1737369618620,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540744559"},{"type":"electronic","value":"9783540744566"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74456-6_12","type":"book-chapter","created":{"date-parts":[[2007,8,14]],"date-time":"2007-08-14T07:29:48Z","timestamp":1187076588000},"page":"115-124","source":"Crossref","is-referenced-by-count":0,"title":["On Approximation of Bookmark Assignments"],"prefix":"10.1007","author":[{"given":"Yuichi","family":"Asahiro","sequence":"first","affiliation":[]},{"given":"Eiji","family":"Miyano","sequence":"additional","affiliation":[]},{"given":"Toshihide","family":"Murata","sequence":"additional","affiliation":[]},{"given":"Hirotaka","family":"Ono","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","unstructured":"Alpern, B., Hoover, R., Rosen, B.K., Sweeney, P.F., Zadeck, F.K.: Incremental evaluation of computational circuits. In: Proc. SODA 1990, pp. 32\u201342 (1990)"},{"key":"12_CR2","unstructured":"Arora, S., Lund, C.: Hardness of Approximation. In: Hochbaum, D.S. (ed.) Approximation Algorithms for NP-hard problems, pp. 399\u2013446. PWS publishing company (1995)"},{"key":"12_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/3-540-40996-3_3","volume-title":"Algorithms and Computation","author":"P. Bose","year":"2000","unstructured":"Bose, P., Kranakis, E., Krizanc, D., Vergas Martin, M., Czyzowicz, J., Pelc, A., Gasieniec, J.: Strategies for hotlink assignments. In: Lee, D.T., Teng, S.-H. (eds.) ISAAC 2000. LNCS, vol.\u00a01969, pp. 23\u201334. Springer, Heidelberg (2000)"},{"key":"12_CR4","unstructured":"Czyzowicz, J., Kranakis, E., Krizanc, D., Pelc, A., Vergas Martin, M.: Assigning bookmarks in perfect binary trees. Ars Combinatoria, vol. LXXXII (2007)"},{"key":"12_CR5","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2001)","edition":"2"},{"key":"12_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/3-540-45477-2_18","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"S. Fuhrmann","year":"2001","unstructured":"Fuhrmann, S., Krumke, S.O., Wirth, H.-C.: Multiple hotlink assignment. In: Brandst\u00e4dt, A., Le, V.B. (eds.) WG 2001. LNCS, vol.\u00a02204, pp. 189\u2013200. Springer, Heidelberg (2001)"},{"issue":"2","key":"12_CR7","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1006\/jagm.2001.1183","volume":"41","author":"U. Feige","year":"2001","unstructured":"Feige, U., Langberg, M.: Approximation algorithms for maximization problems arising in graph partitioning. J. Algorithms\u00a041(2), 174\u2013211 (2001)","journal-title":"J. Algorithms"},{"issue":"1","key":"12_CR8","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/S0020-0190(99)00031-9","volume":"70","author":"S. Khuller","year":"1999","unstructured":"Khuller, S., Moss, A., Naor, J.: The budgeted maximum coverage problem. IPL\u00a070(1), 39\u201345 (1999)","journal-title":"IPL"},{"key":"12_CR9","unstructured":"Langberg, M.: Approximation Algorithms for Maximization Problems arising in Graph Partitioning. M. Sc. thesis, Weizmann Institute of Science (1998)"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Li, B., Deng, X., Golin, M.J., Sohraby, K.: On the optimal placement of web proxies in the Internet: Linear Topology. In: Proc. HPN 1998, pp. 485\u2013495 (1998)","DOI":"10.1007\/978-0-387-35388-3_28"},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Li, B., Golin, M.J., Italiano, G.F., Deng, X., Sohraby, K.: On the optimal placement of web proxies in the Internet. In: Proc. INFOCOMM 1999, pp. 1282\u20131290 (1999)","DOI":"10.1109\/INFCOM.1999.752146"},{"issue":"1","key":"12_CR12","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/0020-0190(96)00075-0","volume":"59","author":"A. Marchetti-Spaccamela","year":"1996","unstructured":"Marchetti-Spaccamela, A., Nanni, U., Rohnert, H.: Maintaining a topological order under edge insertions. IPL\u00a059(1), 53\u201358 (1996)","journal-title":"IPL"},{"key":"12_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/978-3-540-45078-8_24","volume-title":"Algorithms and Data Structures","author":"R. Matichin","year":"2003","unstructured":"Matichin, R., Peleg, D.: 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":"12_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/978-3-540-27796-5_21","volume-title":"Structural Information and Communication Complexity","author":"R. Matichin","year":"2004","unstructured":"Matichin, R., Peleg, D.: Approximation algorithm for hotlink assignment in the greedy model. In: Kralovic, R., S\u00fdkora, O. (eds.) SIROCCO 2004. LNCS, vol.\u00a03104, pp. 233\u2013244. Springer, Heidelberg (2004)"},{"key":"12_CR15","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF01588971","volume":"14","author":"G. Nemhauser","year":"1978","unstructured":"Nemhauser, G., Wolsey, L., Fisher, M.: An analysis of the approximations for maximizing submodular set functions. Mathematical Programming\u00a014, 265\u2013294 (1978)","journal-title":"Mathematical Programming"},{"key":"12_CR16","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/BF01202286","volume":"4","author":"E. Petrank","year":"1994","unstructured":"Petrank, E.: The hardness of approximation: gap location. Computational Complexity\u00a04, 133\u2013157 (1994)","journal-title":"Computational Complexity"},{"key":"12_CR17","doi-asserted-by":"publisher","first-page":"1245","DOI":"10.1016\/S1389-1286(99)00017-1","volume":"31","author":"M. Perkowitz","year":"1999","unstructured":"Perkowitz, M., Etzioni, O.: Towards adaptive web sites: conceptual framework and case study. Computer Networks\u00a031, 1245\u20131258 (1999)","journal-title":"Computer Networks"},{"key":"12_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"778","DOI":"10.1007\/978-3-540-30551-4_67","volume-title":"Algorithms and Computation","author":"A.A. Pessoa","year":"2004","unstructured":"Pessoa, A.A., Laber, E.S., de Souza, C.: Efficient algorithms for the hotlink assignment problem: the worst case search. In: Fleischer, R., Trippen, G. (eds.) ISAAC 2004. LNCS, vol.\u00a03341, pp. 778\u2013792. Springer, Heidelberg (2004)"},{"key":"12_CR19","unstructured":"Vergas Martin, M.: Enhancing Hyperlink Structure for Improving Web Performance. PhD thesis, School of Computer Science, Carleton University (2002)"},{"issue":"2","key":"12_CR20","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/0166-218X(93)90006-A","volume":"43","author":"R.V. Vohra","year":"1993","unstructured":"Vohra, R.V., Hall, N.G.: A probabilistic analysis of the maximal covering location problem. Discrete Applied Mathmatics\u00a043(2), 175\u2013183 (1993)","journal-title":"Discrete Applied Mathmatics"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74456-6_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T09:36:33Z","timestamp":1737365793000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74456-6_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540744559","9783540744566"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74456-6_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}