{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:29:11Z","timestamp":1742912951230,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642145520"},{"type":"electronic","value":"9783642145537"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-14553-7_6","type":"book-chapter","created":{"date-parts":[[2010,7,26]],"date-time":"2010-07-26T03:59:21Z","timestamp":1280116761000},"page":"35-44","source":"Crossref","is-referenced-by-count":1,"title":["Top-d Rank Aggregation in Web Meta-search Engine"],"prefix":"10.1007","author":[{"given":"Qizhi","family":"Fang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Han","family":"Xiao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shanfeng","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s101070100271","volume":"92","author":"S. Arora","year":"2002","unstructured":"Arora, S., Frieze, A., Kaplan, H.: A new rounding procedure for the assignment problem with applications to dense graph arrangement problems. Mathematical Programming, Ser. A\u00a092, 1\u201336 (2002)","journal-title":"Mathematical Programming, Ser. A"},{"key":"6_CR2","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1006\/jcss.1998.1605","volume":"58","author":"S. Arora","year":"1999","unstructured":"Arora, S., Karger, D., Karpinski, M.: Polynomial-time approximation schemes for dense instances of NP-hard optimization problems. Journal of Computer and System Sciences\u00a058, 193\u2013210 (1999)","journal-title":"Journal of Computer and System Sciences"},{"key":"6_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":"Barthelemy, J.P., Guenoche, A., Hudry, O.: Median linear orders: Heuristics and a branch and bound algorithm. European Journal of Operational Research\u00a042, 313\u2013325 (1989)","journal-title":"European Journal of Operational Research"},{"key":"6_CR4","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1016\/j.tcs.2004.02.043","volume":"352","author":"F.Y.L. Chin","year":"2004","unstructured":"Chin, F.Y.L., Deng, X., Fang, Q., Zhu, S.: Approximate and dynamic rank aggregation. Theoretical Computer Science\u00a0352, 409\u2013424 (2004)","journal-title":"Theoretical Computer Science"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Dwork, C., Kumar, R., Naor, M., Sivakumar, D.: Rank aggregation methods for the web. WWW10, pp. 613\u2013622 (2001)","DOI":"10.1145\/371920.372165"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Gravano, L., Chang, C., Garcia-Molina, H., Paepcke, A.: STARTS: Stanford proposal for internet meta-searching. ACM SIGMOD, Tucson, 207\u2013218 (May 1997)","DOI":"10.1145\/253262.253299"},{"key":"6_CR7","unstructured":"Hoelscher, C.: How Internet Experts Search for Information on the Web. In: The World Conference of the World Wide Web, Internet, and Intranet, Orlando, FL (1998)"},{"key":"6_CR8","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/S0306-4573(99)00056-4","volume":"36","author":"B.J. Jansen","year":"2000","unstructured":"Jansen, B.J., Spink, A., Saracevic, T.: Real life, real users, and real needs: a study and analysis of user queries on the web. Information Processing and Management\u00a036, 207\u2013227 (2000)","journal-title":"Information Processing and Management"},{"key":"6_CR9","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/BF02579324","volume":"7","author":"P. Raghavan","year":"1987","unstructured":"Raghavan, P., Thompson, C.: Randomized rounding: a technique for provably good algorithms and algorithmic proofs. Combinatorica\u00a07, 365\u2013374 (1987)","journal-title":"Combinatorica"},{"key":"6_CR10","unstructured":"Silverstein, C., Henzinger, M., Marais, H., Moricz, M.: Analysis of a very large altavista query log. Technical Report SRC 1998-014, Digital Systems Research Center (1998)"}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14553-7_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T21:40:45Z","timestamp":1578519645000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14553-7_6"}},"subtitle":["(Extended Abstract)"],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642145520","9783642145537"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14553-7_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}