{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:55:53Z","timestamp":1725558953245},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642141645"},{"type":"electronic","value":"9783642141652"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14165-2_45","type":"book-chapter","created":{"date-parts":[[2010,7,5]],"date-time":"2010-07-05T13:26:02Z","timestamp":1278336362000},"page":"527-539","source":"Crossref","is-referenced-by-count":6,"title":["On the Complexity of Searching in Trees: Average-Case Minimization"],"prefix":"10.1007","author":[{"given":"Tobias","family":"Jacobs","sequence":"first","affiliation":[]},{"given":"Ferdinando","family":"Cicalese","sequence":"additional","affiliation":[]},{"given":"Eduardo","family":"Laber","sequence":"additional","affiliation":[]},{"given":"Marco","family":"Molinaro","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"45_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-85363-3_1","volume-title":"Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques","author":"M. Adler","year":"2008","unstructured":"Adler, M., Heeringa, B.: Approximating optimal binary decision trees. In: Goel, A., Jansen, K., Rolim, J.D.P., Rubinfeld, R. (eds.) APPROX and RANDOM 2008. LNCS, vol.\u00a05171, pp. 1\u20139. Springer, Heidelberg (2008)"},{"issue":"3","key":"45_CR2","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1142\/S0218195998000175","volume":"8","author":"E. Arkin","year":"1998","unstructured":"Arkin, E., Meijer, H., Mitchell, J., Rappaport, D., Skiena, S.: Decision trees for geometric models. Int. Jour. of Comp. Geom. and Appl.\u00a08(3), 343\u2013364 (1998)","journal-title":"Int. Jour. of Comp. Geom. and Appl."},{"issue":"6","key":"45_CR3","doi-asserted-by":"publisher","first-page":"2090","DOI":"10.1137\/S009753979731858X","volume":"28","author":"Y. Ben-Asher","year":"1999","unstructured":"Ben-Asher, Y., Farchi, E., Newman, I.: Optimal search in trees. SIAM Journal on Computing\u00a028(6), 2090\u20132102 (1999)","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"45_CR4","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.tcs.2003.06.001","volume":"321","author":"R. Carmo","year":"2004","unstructured":"Carmo, R., Donadelli, J., Kohayakawa, Y., Laber, E.: Searching in random partially ordered sets. Theoretical Computer Science\u00a0321(1), 41\u201357 (2004)","journal-title":"Theoretical Computer Science"},{"key":"45_CR5","doi-asserted-by":"crossref","unstructured":"Chakaravarthy, V., Pandit, V., Roy, S., Awasthi, P., Mohania, M.: Decision trees for entity identification: Approximation algorithms and hardness results. In: PODS, pp. 53\u201362 (2007)","DOI":"10.1145\/1265530.1265538"},{"key":"45_CR6","doi-asserted-by":"crossref","unstructured":"Daskalakis, C., Karp, R., Mossel, E., Riesenfeld, S., Verbin, E.: Sorting and selection in posets. In: SODA, pp. 392\u2013401 (2009)","DOI":"10.1137\/1.9781611973068.44"},{"issue":"6","key":"45_CR7","doi-asserted-by":"publisher","first-page":"592","DOI":"10.1007\/BF01189071","volume":"13","author":"P. Torre de la","year":"1995","unstructured":"de la Torre, P., Greenlaw, R., Sch\u00e4ffer, A.: Optimal edge ranking of trees in polynomial time. Algorithmica\u00a013(6), 592\u2013618 (1995)","journal-title":"Algorithmica"},{"key":"45_CR8","doi-asserted-by":"publisher","first-page":"2493","DOI":"10.1016\/j.dam.2008.03.007","volume":"156","author":"D. Dereniowski","year":"2008","unstructured":"Dereniowski, D.: Edge ranking and searching in partial orders. DAM\u00a0156, 2493\u20132500 (2008)","journal-title":"DAM"},{"key":"45_CR9","doi-asserted-by":"crossref","unstructured":"Faigle, U., Lov\u00e1sz, L., Schrader, R., Tur\u00e1n, G.: Searching in trees, series-parallel and interval orders. SICOMP: SIAM Journal on Computing\u00a015 (1986)","DOI":"10.1137\/0215077"},{"issue":"2","key":"45_CR10","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1137\/0123019","volume":"23","author":"M. Garey","year":"1972","unstructured":"Garey, M.: Optimal binary identification procedures. SIAP\u00a023(2), 173\u2013186 (1972)","journal-title":"SIAP"},{"key":"45_CR11","volume-title":"Computers and Intractability: A Guide to the Theory of NP\u2013Completeness","author":"M. Garey","year":"1979","unstructured":"Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP\u2013Completeness. Freeman, New York (1979)"},{"issue":"4","key":"45_CR12","doi-asserted-by":"publisher","first-page":"622","DOI":"10.1137\/0206045","volume":"6","author":"A. Garsia","year":"1977","unstructured":"Garsia, A., Wachs, M.: A new algorithm for minimum cost binary trees. SIAM Journal on Computing\u00a06(4), 622\u2013642 (1977)","journal-title":"SIAM Journal on Computing"},{"key":"45_CR13","doi-asserted-by":"crossref","unstructured":"Hu, T., Tucker, A.: Optimal computer search trees and variable-length alphabetic codes. SIAM Journal on Applied Mathematics\u00a021(4) (1971)","DOI":"10.1137\/0121057"},{"issue":"1","key":"45_CR14","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/0020-0190(76)90095-8","volume":"5","author":"L. Hyafil","year":"1976","unstructured":"Hyafil, L., Rivest, R.: Constructing optimal binary decision trees is NP-complete. Information Processing Letters\u00a05(1), 15\u201317 (1976)","journal-title":"Information Processing Letters"},{"issue":"4","key":"45_CR15","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1145\/321906.321909","volume":"22","author":"O. Ibarra","year":"1975","unstructured":"Ibarra, O., Kim, C.: Fast approximation algorithms for the knapsack and sum of subset problems. Journal of the ACM\u00a022(4), 463\u2013468 (1975)","journal-title":"Journal of the ACM"},{"key":"45_CR16","volume-title":"The Art of Computer Programming, Sorting and Searching","author":"D. Knuth","year":"1973","unstructured":"Knuth, D.: The Art of Computer Programming, Sorting and Searching, vol.\u00a03. Addison-Wesley, Reading (1973)"},{"key":"45_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/3-540-48447-7_17","volume-title":"Algorithms and Data Structures","author":"R. Kosaraju","year":"1999","unstructured":"Kosaraju, R., Przytycka, T., Borgstrom, R.: On an optimal split tree problem. In: Dehne, F., Gupta, A., Sack, J.-R., Tamassia, R. (eds.) WADS 1999. LNCS, vol.\u00a01663, pp. 157\u2013168. Springer, Heidelberg (1999)"},{"key":"45_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/978-3-540-70575-8_38","volume-title":"Automata, Languages and Programming","author":"E. Laber","year":"2008","unstructured":"Laber, E., Molinaro, M.: An approximation algorithm for binary searching in trees. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol.\u00a05125, pp. 459\u2013471. Springer, Heidelberg (2008)"},{"issue":"1-2","key":"45_CR19","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/j.dam.2004.06.002","volume":"144","author":"E. Laber","year":"2004","unstructured":"Laber, E., Nogueira, L.: On the hardness of the minimum height decision tree problem. Discrete Applied Mathematics\u00a0144(1-2), 209\u2013212 (2004)","journal-title":"Discrete Applied Mathematics"},{"key":"45_CR20","unstructured":"Lam, T., Yue, F.: Optimal edge ranking of trees in linear time. In: SODA, pp. 436\u2013445 (1998)"},{"key":"45_CR21","unstructured":"Larmore, H., Hirschberg, D.S., Larmore, L.L., Molodowitch, M.: Subtree weight ratios for optimal binary search trees. Technical report (1986)"},{"key":"45_CR22","doi-asserted-by":"crossref","unstructured":"Linial, N., Saks, M.: Searching ordered structures. J. of Algorithms\u00a06 (1985)","DOI":"10.1016\/0196-6774(85)90020-3"},{"issue":"1","key":"45_CR23","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1109\/18.370098","volume":"41","author":"M. Lipman","year":"1995","unstructured":"Lipman, M., Abrahams, J.: Minimum average cost testing for partially ordered components. IEEE Transactions on Information Theory\u00a041(1), 287\u2013291 (1995)","journal-title":"IEEE Transactions on Information Theory"},{"key":"45_CR24","unstructured":"Mozes, S., Onak, K., Weimann, O.: Finding an optimal tree searching strategy in linear time. In: SODA, pp. 1096\u20131105 (2008)"},{"key":"45_CR25","doi-asserted-by":"crossref","unstructured":"Onak, K., Parys, P.: Generalization of binary search: Searching in trees and forest-like partial orders. In: FOCS, pp. 379\u2013388 (2006)","DOI":"10.1109\/FOCS.2006.32"},{"key":"45_CR26","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/0020-0190(89)90161-0","volume":"33","author":"A. Sch\u00e4ffer","year":"1989","unstructured":"Sch\u00e4ffer, A.: Optimal node ranking of trees in linear time. IPL\u00a033, 91\u201396 (1989)","journal-title":"IPL"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14165-2_45.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:48:21Z","timestamp":1606186101000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14165-2_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642141645","9783642141652"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14165-2_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}