{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:04:37Z","timestamp":1725559477130},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540259206"},{"type":"electronic","value":"9783540320784"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11427186_24","type":"book-chapter","created":{"date-parts":[[2010,7,13]],"date-time":"2010-07-13T21:38:24Z","timestamp":1279057104000},"page":"265-276","source":"Crossref","is-referenced-by-count":2,"title":["Multiple-Winners Randomized Tournaments with Consensus for Optimization Problems in Generic Metric Spaces"],"prefix":"10.1007","author":[{"given":"Domenico","family":"Cantone","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alfredo","family":"Ferro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rosalba","family":"Giugno","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giuseppe Lo","family":"Presti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alfredo","family":"Pulvirenti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"24_CR1","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1016\/0304-3975(96)00089-8","volume":"165","author":"V. Auletta","year":"1996","unstructured":"Auletta, V., Parente, D., Persiano, G.: Dynamic and static algorithms for optimal placement of resources in a tree. Theoretical Computer Science\u00a0165, 441\u2013461 (1996)","journal-title":"Theoretical Computer Science"},{"key":"24_CR2","unstructured":"Binderberger, M.O.: Corel images database. UCI Knowledge Discovery in Databases Archive (1999), \n                    \n                      http:\/\/kdd.ics.uci.edu\/"},{"key":"24_CR3","doi-asserted-by":"crossref","unstructured":"Borodin, A., Ostrovsky, R., Rabani, Y.: Subquadratic approximation algorithms for clustering problems in high dimensional spaces. In: Ann. ACM Symp. Theory of Computing, pp. 435\u2013444 (1999)","DOI":"10.1145\/301250.301367"},{"issue":"3","key":"24_CR4","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1145\/328939.328959","volume":"24","author":"T. Bozkaya","year":"1999","unstructured":"Bozkaya, T., Ozsoyoglu, M.: Indexing large metric spaces for similarity search queries. ACM Transaction on Database Systems\u00a024(3), 361\u2013404 (1999)","journal-title":"ACM Transaction on Database Systems"},{"issue":"3","key":"24_CR5","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/BF02684332","volume":"60","author":"R.E. Burkard","year":"1998","unstructured":"Burkard, R.E., Krarup, J.: A linear algorithm for the pos\/neg-weighted 1-median problem on a cactus. Computing\u00a060(3), 193\u2013216 (1998)","journal-title":"Computing"},{"key":"24_CR6","doi-asserted-by":"crossref","unstructured":"Cantone, D., Cincotti, G., Ferro, A., Pulvirenti, A.: An efficient approximate algorithm for the 1-median problem in metric spaces. SIAM Journal on Optimization (2005) (to appear)","DOI":"10.1137\/S1052623403424740"},{"key":"24_CR7","doi-asserted-by":"crossref","unstructured":"Cantone, D., Ferro, A., Pulvirenti, A., Reforgiato, D., Shasha, D.: Antipole tree indexing to support range search and k-nearest neighbor search in metric spaces. IEEE Transaction on knowledge and Data Engineering\u00a017(4) (2005)","DOI":"10.1109\/TKDE.2005.53"},{"key":"24_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-1445-5","volume-title":"Searching Multimedia Databases by Content","author":"C. Faloutsos","year":"1996","unstructured":"Faloutsos, C.: Searching Multimedia Databases by Content. Kluwer Academic Publishers Group, The Netherlands (1996)"},{"key":"24_CR9","volume-title":"Information Retrieval - Data Structures and Algorithms","author":"W.B. Frakes","year":"1992","unstructured":"Frakes, W.B., Baeza-Yates, R.: Information Retrieval - Data Structures and Algorithms. Prentice Hall, New Jersey (1992)"},{"key":"24_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/BFb0028271","volume-title":"Algorithms and Data Structures","author":"G.N. Frederickson","year":"1991","unstructured":"Frederickson, G.N.: Parametric search and locating supply centers in trees. In: Dehne, F., Sack, J.-R., Santoro, N. (eds.) WADS 1991. LNCS, vol.\u00a0519, pp. 299\u2013319. Springer, Heidelberg (1991)"},{"key":"24_CR11","volume-title":"Introduction to Statistical Pattern Recognition","author":"K. Fukunaga","year":"1990","unstructured":"Fukunaga, K.: Introduction to Statistical Pattern Recognition. Academic Press, New York (1990)"},{"key":"24_CR12","doi-asserted-by":"crossref","unstructured":"Ganti, V., Ramakrishnan, R., Gehrke, J., Powell, A., French, J.: Clustering large datasets in arbitrary metric spaces. In: Proceedings of the IEEE 15th International Conference on Data Engineering, pp. 502\u2013511 (1999)","DOI":"10.1109\/ICDE.1999.754966"},{"key":"24_CR13","unstructured":"Goel, A., Indyk, P., Varadarajan, K.: Reductions among high dimensional proximity problems. In: Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 769\u2013778 (2001)"},{"key":"24_CR14","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/0304-3975(85)90224-5","volume":"38","author":"T.F. Gonzalez","year":"1985","unstructured":"Gonzalez, T.F.: Clustering to minimize the maximum intercluster distance. Theoretical Computer Science\u00a038, 293\u2013306 (1985)","journal-title":"Theoretical Computer Science"},{"key":"24_CR15","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF02460299","volume":"55","author":"E. Gusfield","year":"1993","unstructured":"Gusfield, E.: Efficient methods for multiple sequence alignments with guaranteed error bounds. Bulletin of Mathematical Biology\u00a055, 141\u2013154 (1993)","journal-title":"Bulletin of Mathematical Biology"},{"key":"24_CR16","doi-asserted-by":"crossref","unstructured":"Indyk, P.: Sublinear time algorithms for metric space problems. In: Proceedings of the 31st Annual ACM Symposium on Theory of Computing, pp. 428\u2013434 (1999)","DOI":"10.1145\/301250.301366"},{"key":"24_CR17","unstructured":"Indyk, P.: Dimensionality reduction techniques for proximity problems. In: Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 371\u2013378 (2000)"},{"key":"24_CR18","volume-title":"Randomized Algorithms","author":"R. Motwani","year":"2000","unstructured":"Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, Cambridge (2000)"},{"key":"24_CR19","doi-asserted-by":"crossref","unstructured":"Swift, S., Tucker, A., Vinciotti, V., Martin, N., Orengo, C., Liu, X., Kellam, P.: Consensus clustering and functional interpretation of gene-expression data. Genome Biology\u00a05(11) (2004)","DOI":"10.1186\/gb-2004-5-11-r94"}],"container-title":["Lecture Notes in Computer Science","Experimental and Efficient Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11427186_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T20:01:22Z","timestamp":1558296082000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11427186_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540259206","9783540320784"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/11427186_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}