{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T05:26:26Z","timestamp":1737523586711,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540405344"},{"type":"electronic","value":"9783540450719"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-45071-8_28","type":"book-chapter","created":{"date-parts":[[2007,10,27]],"date-time":"2007-10-27T08:04:43Z","timestamp":1193472283000},"page":"262-271","source":"Crossref","is-referenced-by-count":0,"title":["Approximate Rank Aggregation"],"prefix":"10.1007","author":[{"given":"Xiaotie","family":"Deng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qizhi","family":"Fang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shanfeng","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,6,24]]},"reference":[{"key":"28_CR1","doi-asserted-by":"crossref","unstructured":"S. Arora, A. Frieze and H. Kaplan, A new rounding procedure for the assignment problem with applications to dense graph arrangement problems, FOCS96:21\u201330","DOI":"10.1109\/SFCS.1996.548460"},{"key":"28_CR2","doi-asserted-by":"crossref","unstructured":"S. Arora, D. Karger and M. Karpinski, Polynomial-time approximation schemes for dense instances of NP-hard optimization problems, STOC95:284\u2013293","DOI":"10.1145\/225058.225140"},{"key":"28_CR3","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1016\/0377-2217(89)90442-6","volume":"42","author":"J.P. Barthelemy","year":"1989","unstructured":"J.P. Barthelemy, A. Guenoche and O. Hudry, Median linear orders: Heuristics and a branch and bound algorithm, European Journal of Operational Research 42(1989): 313\u2013325.","journal-title":"European Journal of Operational Research"},{"key":"28_CR4","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/0165-4896(81)90041-X","volume":"1","author":"J.P. Barthelemy","year":"1981","unstructured":"J.P. Barthelemy and B. Monjardet, The median Procedure in cluster analysis and social choice theory, Mathematical Social Sciences 1(1981): 235\u2013267.","journal-title":"Mathematical Social Sciences"},{"key":"28_CR5","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF00303169","volume":"6","author":"J.J. Bartholdi","year":"1989","unstructured":"J.J. Bartholdi, D.A. Tovey and M.A. Trick, Voting schemes for which it can be difficult to tell who won the election, Social Choice and Welfare, 6(1989): 157\u2013165.","journal-title":"Social Choice and Welfare"},{"key":"28_CR6","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/S0012-365X(96)00166-5","volume":"165\/166","author":"I. Charon","year":"1997","unstructured":"I. Charon, A. Guenoche, O. Hudry and F. Woirgard, New results on the computation of median orders, Discrete Mathematics 165\/166(1997): 139\u2013153.","journal-title":"Discrete Mathematics"},{"key":"28_CR7","doi-asserted-by":"crossref","unstructured":"C. Dwork, R. Kumar, M. Naor and D. Sivakumar, Rank aggregation methods for the web, WWW10 (2001), 613\u2013622.","DOI":"10.1145\/371920.372165"},{"key":"28_CR8","doi-asserted-by":"publisher","first-page":"1203","DOI":"10.1137\/S0097539794268765","volume":"27","author":"D. Gillman","year":"1998","unstructured":"D. Gillman, A Chernoff bound for random walks on expanders, SIAM J. Comput. 27(1998): 1203\u20131220.","journal-title":"SIAM J. Comput."},{"key":"28_CR9","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"R.M. Karp","year":"1972","unstructured":"R.M. Karp, Reducibility among combinatorial problems, in: R.E. Miller and J.W. Thatcher, eds., Complexity of Computer Computations (Plenue, New York, 1972) 85\u2013103."},{"key":"28_CR10","first-page":"577","volume":"88","author":"J.G. Kemeny","year":"1959","unstructured":"J.G. Kemeny, Mathematics without numbers, Daedalus 88(1959): 577\u2013591.","journal-title":"Daedalus"},{"key":"28_CR11","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1016\/0022-0000(88)90003-7","volume":"37","author":"P. Raghavan","year":"1988","unstructured":"P. Raghavan, Probabilistic construction of deterministic algorithms: Approximating packing integer programs, Journal of Computer and System Sciences 37(1988): 130\u2013143.","journal-title":"Journal of Computer and System Sciences"},{"key":"28_CR12","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/BF02579324","volume":"7","author":"P. Raghavan","year":"1987","unstructured":"P. Raghavan and C. Thompson, Randomized rounding: a technique for provably good algorithms and algorithmic proofs, Combinatorica 7(1987): 365\u2013374.","journal-title":"Combinatorica"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45071-8_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T23:25:23Z","timestamp":1737501923000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45071-8_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540405344","9783540450719"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-45071-8_28","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}