{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T15:50:13Z","timestamp":1725983413737},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319946665"},{"type":"electronic","value":"9783319946672"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-94667-2_19","type":"book-chapter","created":{"date-parts":[[2018,7,3]],"date-time":"2018-07-03T03:56:24Z","timestamp":1530590184000},"page":"224-236","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Median of 3 Permutations, 3-Cycles and 3-Hitting Set Problem"],"prefix":"10.1007","author":[{"given":"Robin","family":"Milosz","sequence":"first","affiliation":[]},{"given":"Sylvie","family":"Hamel","sequence":"additional","affiliation":[]},{"given":"Adeline","family":"Pierrot","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,7,4]]},"reference":[{"issue":"2","key":"19_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-$$m$$ lists. Algorithmica 57(2), 284\u2013300 (2010)","journal-title":"Algorithmica"},{"key":"19_CR2","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.mathsocsci.2011.08.008","volume":"64","author":"A Ali","year":"2012","unstructured":"Ali, A., Meil\u0103, M.: Experiments with Kemeny ranking: what works when? Math. Soc. Sci. 64, 28\u201340 (2012)","journal-title":"Math. Soc. Sci."},{"key":"19_CR3","unstructured":"Bachmeier, G., Brandt, F., Geist, C., Harrenstein, P., Kardel, K., Peters, D., Seedig, H.G.: k-Majority Digraphs and the Hardness of Voting with a Constant Number of Voters arXiv: \nhttp:\/\/arxiv.org\/abs\/1704.06304v1\n\n (2017)"},{"key":"19_CR4","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1007\/s10458-013-9236-y","volume":"28","author":"N Betzler","year":"2014","unstructured":"Betzler, N., Bredereck, R., Niedermeier, R.: Theoretical and empirical evaluation of data reduction for exact Kemeny rank aggregation. Auton. Agent. Multi-Agent Syst. 28, 721\u2013748 (2014)","journal-title":"Auton. Agent. Multi-Agent Syst."},{"key":"19_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11618058_1","volume-title":"Graph Drawing","author":"T Biedl","year":"2006","unstructured":"Biedl, T., Brandenburg, F.J., Deng, X.: Crossings and permutations. In: Healy, P., Nikolov, N.S. (eds.) GD 2005. LNCS, vol. 3843, pp. 1\u201312. Springer, Heidelberg (2006). \nhttps:\/\/doi.org\/10.1007\/11618058_1"},{"issue":"2","key":"19_CR6","first-page":"161","volume":"21","author":"G Blin","year":"2011","unstructured":"Blin, G., Crochemore, M., Hamel, S., Vialette, S.: Median of an odd number of permutations. Pure Math. Appl. 21(2), 161\u2013175 (2011)","journal-title":"Pure Math. Appl."},{"key":"19_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/978-3-642-22351-8_5","volume-title":"Scientific and Statistical Database Management","author":"S Cohen-Boulakia","year":"2011","unstructured":"Cohen-Boulakia, S., Denise, A., Hamel, S.: Using medians to generate consensus rankings for biological data. In: Bayard Cushing, J., French, J., Bowers, S. (eds.) SSDBM 2011. LNCS, vol. 6809, pp. 73\u201390. Springer, Heidelberg (2011). \nhttps:\/\/doi.org\/10.1007\/978-3-642-22351-8_5"},{"key":"19_CR8","unstructured":"Condorcet, M.J.: Essai sur l\u2019application de l\u2019analyse \u00e0 la probabilit\u00e9 des d\u00e9cisions rendues \u00e0 la pluralit\u00e9 des voix. Imprimerie Royale, 191 p. (1785)"},{"key":"19_CR9","unstructured":"Conitzer, V., Davenport, A., Kalagnanam, J.: Improved bounds for computing Kemeny rankings. In: Proceedings of AAAI - Volume 1, pp. 620\u2013626 (2006)"},{"key":"19_CR10","unstructured":"Davenport, A., Kalagnanam, J.: A computational study of the Kemeny rule for preference aggregation. In: Proceedings of the 19th National Conference on Artificial Intelligence, AAAI 2004, pp. 697\u2013702 (2004)"},{"key":"19_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 WWW, pp. 613\u2013622 (2001)","DOI":"10.1145\/371920.372165"},{"issue":"3","key":"19_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 J. Discret. Math. 20(3), 628\u2013648 (2006)","journal-title":"SIAM J. Discret. Math."},{"key":"19_CR13","unstructured":"Guo, J., Niedermeier, R., Betzler, N., Fellows, M.R., Rosamond, F.A.: How similarity helps to efficiently compute Kemeny rankings. In: Proceedings of the 8th International Conference on Autonomous Agents and Multi-Agent Systems (2009)"},{"key":"19_CR14","series-title":"The IBM Research Symposia Series","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"RM Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W., Bohlinger, J.D. (eds.) Complexity of Computer Computations. IRSS, pp. 85\u2013103. Springer, Boston (1972). \nhttps:\/\/doi.org\/10.1007\/978-1-4684-2001-29"},{"key":"19_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-642-17517-6_3","volume-title":"Algorithms and Computation","author":"M Karpinski","year":"2010","unstructured":"Karpinski, M., Schudy, W.: Faster algorithms for feedback arc set tournament, Kemeny rank aggregation and betweenness tournament. In: Cheong, O., Chwa, K.-Y., Park, K. (eds.) ISAAC 2010. LNCS, vol. 6506, pp. 3\u201314. Springer, Heidelberg (2010). \nhttps:\/\/doi.org\/10.1007\/978-3-642-17517-6_3"},{"key":"19_CR16","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1093\/biomet\/30.1-2.81","volume":"30","author":"M Kendall","year":"1938","unstructured":"Kendall, M.: A new measure of rank correlation. Biometrika 30, 81\u201389 (1938)","journal-title":"Biometrika"},{"issue":"2","key":"19_CR17","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1137\/0135023","volume":"35","author":"HP Young","year":"1978","unstructured":"Young, H.P., Levenglick, A.: A consistent extension of Condorcet\u2019s election principle. SIAM J. Appl. Math. 35(2), 285\u2013300 (1978)","journal-title":"SIAM J. Appl. Math."},{"key":"19_CR18","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/978-3-642-41575-3_20","volume-title":"Algorithmic Decision Theory","author":"N Mattei","year":"2013","unstructured":"Mattei, N., Walsh, T.: PrefLib: a library for preferences http:\/\/www.preflib.org. In: Perny, P., Pirlot, M., Tsouki\u00e0s, A. (eds.) ADT 2013. LNCS (LNAI), vol. 8176, pp. 259\u2013270. Springer, Heidelberg (2013). \nhttps:\/\/doi.org\/10.1007\/978-3-642-41575-3_20"},{"key":"19_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1007\/978-3-319-29221-2_23","volume-title":"Algorithms and Discrete Applied Mathematics","author":"R Milosz","year":"2016","unstructured":"Milosz, R., Hamel, S.: Medians of permutations: building constraints. In: Govindarajan, S., Maheshwari, A. (eds.) CALDAM 2016. LNCS, vol. 9602, pp. 264\u2013276. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-29221-2_23"},{"key":"19_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1007\/978-3-642-40104-6_44","volume-title":"Algorithms and Data Structures","author":"N Nishimura","year":"2013","unstructured":"Nishimura, N., Simjour, N.: Parameterized enumeration of (locally-) optimal aggregations. In: Dehne, F., Solis-Oba, R., Sack, J.-R. (eds.) WADS 2013. LNCS, vol. 8037, pp. 512\u2013523. Springer, Heidelberg (2013). \nhttps:\/\/doi.org\/10.1007\/978-3-642-40104-6_44"},{"key":"19_CR21","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1137\/1.9781611972894.4","volume-title":"2009 Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments (ALENEX)","author":"Frans Schalekamp","year":"2009","unstructured":"Schalekamp, F., van Zuylen, A.: Rank aggregation: together we\u2019re strong. In: Proceedings of the 11th SIAM Workshop on Algorithm Engineering and Experiments, ALENEX, pp. 38\u201351 (2009)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-94667-2_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,7,3]],"date-time":"2018-07-03T04:10:08Z","timestamp":1530591008000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-94667-2_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319946665","9783319946672"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-94667-2_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}