{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:08:24Z","timestamp":1725566904330},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540282396"},{"type":"electronic","value":"9783540318743"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11538462_7","type":"book-chapter","created":{"date-parts":[[2010,9,28]],"date-time":"2010-09-28T04:13:22Z","timestamp":1285647202000},"page":"74-85","source":"Crossref","is-referenced-by-count":4,"title":["Where\u2019s the Winner? Max-Finding and Sorting with Metric Costs"],"prefix":"10.1007","author":[{"given":"Anupam","family":"Gupta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amit","family":"Kumar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","series-title":"Sorting and searching","volume-title":"The art of computer programming","author":"D.E. Knuth","year":"1973","unstructured":"Knuth, D.E.: The art of computer programming. Sorting and searching, vol.\u00a03. Addison- Wesley Publishing Co., Reading (1973)"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Charikar, M., Fagin, R., Guruswami, V., Kleinberg, J., Raghavan, P., Sahai, A.: Query strategies for priced information. In: Proc. 32nd ACM STOC, pp. 582\u2013591 (2000)","DOI":"10.1145\/335305.335382"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Gupta, A., Kumar, A.: Sorting and selection with structured costs. In: Proc. 42nd IEEE FOCS, pp. 416\u2013425 (2001)","DOI":"10.1109\/SFCS.2001.959916"},{"key":"7_CR4","unstructured":"Kannan, S., Khanna, S.: Selection with monotone comparison costs. In: Proc. 14th ACM SIAM SODA, pp. 10\u201317 (2003)"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Bartal, Y.: Probabilistic approximations of metric spaces and its algorithmic applications. In: Proc. 37th IEEE FOCS, pp. 184\u2013193 (1996)","DOI":"10.1109\/SFCS.1996.548477"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Fakcharoenphol, J., Rao, S., Talwar, K.: A tight bound on approximating arbitrary metrics by tree metrics. In: Proc. 35th ACM STOC, pp. 448\u2013455 (2003)","DOI":"10.1145\/780542.780608"},{"key":"7_CR7","unstructured":"Hartline, J., Hong, E., Mohr, A., Rocke, E., Yasuhara, K.: As reported in [3]"},{"key":"7_CR8","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1080\/15427951.2004.10129077","volume":"1","author":"J. Kleinberg","year":"2003","unstructured":"Kleinberg, J.: Detecting a network failure. Internet Math\u00a01, 37\u201355 (2003)","journal-title":"Internet Math"}],"container-title":["Lecture Notes in Computer Science","Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11538462_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:13:54Z","timestamp":1605644034000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11538462_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540282396","9783540318743"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/11538462_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}