{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T23:18:45Z","timestamp":1773271125712,"version":"3.50.1"},"reference-count":16,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1109\/isit.2017.8007080","type":"proceedings-article","created":{"date-parts":[[2017,8,29]],"date-time":"2017-08-29T18:54:37Z","timestamp":1504032877000},"page":"3000-3004","source":"Crossref","is-referenced-by-count":1,"title":["Multiclass MinMax rank aggregation"],"prefix":"10.1109","author":[{"given":"Pan","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Olgica","family":"Milenkovic","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/1055558.1055568"},{"key":"ref11","first-page":"577","article-title":"Mathematics without numbers","volume":"88","author":"kemeny","year":"1959","journal-title":"Daedalus"},{"key":"ref12","first-page":"95","article-title":"How to rank with few errors","author":"claire","year":"2007","journal-title":"Proceedings of the Thirty-Ninth Annual ACM Symposium on Theory of Computing"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.2307\/2333244"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139058520"},{"key":"ref15","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1016\/S0022-0000(02)00011-9","article-title":"Efficient algorithms for multichromosomal genome rearrangements","volume":"65","author":"glenn","year":"2002","journal-title":"Journal of Computerand System Sciences"},{"key":"ref16","first-page":"260","article-title":"Deterministic algorithms for rank aggregation and other ranking and clustering problems","author":"zuylen","year":"2007","journal-title":"7th International Workshop on Approximation and Online Algorithms"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/BF00303169"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2014.10.002"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/1109557.1109619"},{"key":"ref5","first-page":"26","article-title":"Genome-scale evolution: reconstructing gene orders in the ancestral species","volume":"12","author":"bourque","year":"2002","journal-title":"Genome Research"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0037576"},{"key":"ref7","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1111\/j.2517-6161.1977.tb01624.x","article-title":"Spearman's footrule as a measure of disarray","author":"diaconis","year":"1977","journal-title":"Journal of the Royal Statistical Society Series B (Methodological)"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/1411509.1411513"},{"key":"ref1","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1007\/s00453-008-9211-1","article-title":"Aggregation of partial rankings, p-ratings and top-m lists","volume":"57","author":"nir","year":"2010","journal-title":"Algorithmica"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/371920.372165"}],"event":{"name":"2017 IEEE International Symposium on Information Theory (ISIT)","location":"Aachen, Germany","start":{"date-parts":[[2017,6,25]]},"end":{"date-parts":[[2017,6,30]]}},"container-title":["2017 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7999336\/8006474\/08007080.pdf?arnumber=8007080","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,2]],"date-time":"2019-10-02T22:20:11Z","timestamp":1570054811000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8007080\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/isit.2017.8007080","relation":{},"subject":[],"published":{"date-parts":[[2017,6]]}}}