{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,6]],"date-time":"2025-03-06T05:30:37Z","timestamp":1741239037336,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642212031"},{"type":"electronic","value":"9783642212048"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-21204-8_37","type":"book-chapter","created":{"date-parts":[[2011,5,28]],"date-time":"2011-05-28T05:15:25Z","timestamp":1306559725000},"page":"352-363","source":"Crossref","is-referenced-by-count":2,"title":["The Nearest Neighbor Spearman Footrule Distance for Bucket, Interval, and Partial Orders"],"prefix":"10.1007","author":[{"given":"Franz J.","family":"Brandenburg","sequence":"first","affiliation":[]},{"given":"Andreas","family":"Glei\u00dfner","sequence":"additional","affiliation":[]},{"given":"Andreas","family":"Hofmeier","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"37_CR1","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1007\/s00453-008-9211-1","volume":"57","author":"N. Ailon","year":"2010","unstructured":"Ailon, N.: Aggregation of partial rankings, p-ratings and top-k lists. Algorithmica\u00a057, 284\u2013300 (2010)","journal-title":"Algorithmica"},{"key":"37_CR2","first-page":"275","volume-title":"Proceedings of the 24th Annual International Conference on Research and Development in Information Retrieval (SIGIR)","author":"J.A. Aslam","year":"2001","unstructured":"Aslam, J.A., Montague, M.H.: Models for metasearch. In: Proceedings of the 24th Annual International Conference on Research and Development in Information Retrieval (SIGIR), pp. 275\u2013284. ACM, New York (2001)"},{"key":"37_CR3","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF00303169","volume":"6","author":"J.J. Bartholdi III","year":"1989","unstructured":"Bartholdi III, J.J., Tovey, C.A., Trick, M.A.: Voting schemes for which it can be difficult to tell who won the election. Social Choice and Welfare\u00a06, 157\u2013165 (1989)","journal-title":"Social Choice and Welfare"},{"key":"37_CR4","doi-asserted-by":"publisher","first-page":"812","DOI":"10.1016\/j.jcss.2010.04.002","volume":"76","author":"N. Betzler","year":"2010","unstructured":"Betzler, N., Dorn, B.: Towards a dichotomy for the possible winner problem in elections based on scoring rules. Journal of Computer and System Sciences\u00a076, 812\u2013836 (2010)","journal-title":"Journal of Computer and System Sciences"},{"key":"37_CR5","doi-asserted-by":"publisher","first-page":"1813","DOI":"10.1016\/j.disc.2007.12.088","volume":"309","author":"T. Biedl","year":"2009","unstructured":"Biedl, T., Brandenburg, F.J., Deng, X.: On the complexity of crossings in permutations. Discrete Mathematics\u00a0309, 1813\u20131823 (2009)","journal-title":"Discrete Mathematics"},{"key":"37_CR6","unstructured":"Borda, J.C.: M\u00e9moire aux les \u00e9lections au scrutin (1781)"},{"key":"37_CR7","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1613\/jair.587","volume":"10","author":"W.W. Cohen","year":"1999","unstructured":"Cohen, W.W., Schapire, R.E., Singer, Y.: Learning to order things. Journal of Artificial Intelligence Research\u00a010, 243\u2013270 (1999)","journal-title":"Journal of Artificial Intelligence Research"},{"key":"37_CR8","unstructured":"Condorcet, M.-J.: \u00c9ssai sur l\u2019application de l\u2019analyse \u00e0 la probalit\u00e9 des d\u00e9cisions rendues \u00e0 la pluralit\u00e9 des voix (1785)"},{"key":"37_CR9","series-title":"Lecture Notes in Statistics","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1106-8","volume-title":"Metric methods for analyzing partially ranked data","author":"D.E. Critchlow","year":"1985","unstructured":"Critchlow, D.E.: Metric methods for analyzing partially ranked data. Lecture Notes in Statistics, vol.\u00a034. Springer, Berlin (1985)"},{"key":"37_CR10","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1111\/j.2517-6161.1977.tb01624.x","volume":"39","author":"P. Diaconis","year":"1977","unstructured":"Diaconis, P., Graham, R.L.: Spearman\u2019s footrule as a measure of disarray. Journal of the Royal Statistical Society, Series B\u00a039, 262\u2013268 (1977)","journal-title":"Journal of the Royal Statistical Society, Series B"},{"key":"37_CR11","doi-asserted-by":"crossref","unstructured":"Dwork, C., Kumar, R., Naor, M., Sivakumar, D.: Rank aggregation methods for the web. In: Proceedings of the 10th International World Wide Web Conference (WWW 2010), pp. 613\u2013622 (2001)","DOI":"10.1145\/371920.372165"},{"key":"37_CR12","doi-asserted-by":"publisher","first-page":"628","DOI":"10.1137\/05063088X","volume":"20","author":"R. Fagin","year":"2006","unstructured":"Fagin, R., Kumar, R., Mahdian, M., Sivakumar, D., Vee, E.: Comparing partial rankings. SIAM Journal on Discrete Mathematics\u00a020, 628\u2013648 (2006)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"37_CR13","volume-title":"Computers and Intractability; A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1990","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1990)"},{"key":"37_CR14","doi-asserted-by":"publisher","first-page":"806","DOI":"10.1145\/268999.269002","volume":"44","author":"E. Hemaspaandra","year":"1997","unstructured":"Hemaspaandra, E., Hemaspaandra, L.A., Rothe, J.: Exact analysis of Dodgson elections: Lewis Carroll\u2019s 1876 voting system is complete for parallel access to NP. Journal of the ACM\u00a044, 806\u2013825 (1997)","journal-title":"Journal of the ACM"},{"key":"37_CR15","first-page":"363","volume-title":"Proceedings of the 19th International Conference Machine Learning (ICML)","author":"G. Lebanon","year":"2002","unstructured":"Lebanon, G., Lafferty, J.D.: Cranking: Combining rankings using conditional probability models on permutations. In: Proceedings of the 19th International Conference Machine Learning (ICML), pp. 363\u2013370. Morgan Kaufmann, San Francisco (2002)"},{"key":"37_CR16","unstructured":"Lullus, R.: Artifitium electionis personarum (1283)"},{"key":"37_CR17","unstructured":"Lullus, R.: De arte eleccionis (1299)"},{"key":"37_CR18","first-page":"538","volume-title":"Proceedings of the 2002 International Conference on Information and Knowledge Management (CIKM)","author":"M.H. Montague","year":"2002","unstructured":"Montague, M.H., Aslam, J.A.: Condorcet fusion for improved retrieval. In: Proceedings of the 2002 International Conference on Information and Knowledge Management (CIKM), pp. 538\u2013548. ACM, New York (2002)"},{"key":"37_CR19","doi-asserted-by":"publisher","first-page":"841","DOI":"10.1145\/952532.952698","volume-title":"Proceedings of the 2003 Symposium on Applied Computing (SAC)","author":"M.E. Renda","year":"2003","unstructured":"Renda, M.E., Straccia, U.: Web metasearch: Rank vs. score based rank aggregation methods. In: Proceedings of the 2003 Symposium on Applied Computing (SAC), pp. 841\u2013846. ACM, New York (2003)"},{"key":"37_CR20","first-page":"506","volume":"12","author":"J. Sese","year":"2001","unstructured":"Sese, J., Morishita, S.: Rank aggregation method for biological databases. Genome Informatics\u00a012, 506\u2013507 (2001)","journal-title":"Genome Informatics"},{"key":"37_CR21","unstructured":"van Zuylen, A., Hegde, R., Jain, K., Williamson, D.P.: Deterministic pivoting algorithms for constrained ranking and clustering problems. In: Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 405\u2013414 (2007)"},{"key":"37_CR22","doi-asserted-by":"publisher","first-page":"594","DOI":"10.1287\/moor.1090.0385","volume":"34","author":"A. Zuylen van","year":"2009","unstructured":"van Zuylen, A., Williamson, D.P.: Deterministic pivoting algorithms for constrained ranking and clustering problems. Mathematics of Operations Research\u00a034, 594\u2013620 (2009)","journal-title":"Mathematics of Operations Research"},{"key":"37_CR23","first-page":"196","volume-title":"Proceedings of the 23rd National Conference on Artificial Intelligence (AAAI)","author":"L. Xia","year":"2008","unstructured":"Xia, L., Conitzer, V.: Determining possible and necessary winners under common voting rules given partial orders. In: Proceedings of the 23rd National Conference on Artificial Intelligence (AAAI), pp. 196\u2013201. AAAI Press, Menlo Park (2008)"},{"key":"37_CR24","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/s005000050056","volume":"3","author":"R.R. Yager","year":"1999","unstructured":"Yager, R.R., Kreinovich, V.: On how to merge sorted lists coming from different web search tools. Soft Computing Research Journal\u00a03, 83\u201388 (1999)","journal-title":"Soft Computing Research Journal"}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics and Algorithmic Aspects in Information and Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21204-8_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,5]],"date-time":"2025-03-05T21:54:55Z","timestamp":1741211695000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21204-8_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642212031","9783642212048"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21204-8_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}