{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T02:32:39Z","timestamp":1771036359328,"version":"3.50.1"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2012,11,16]],"date-time":"2012-11-16T00:00:00Z","timestamp":1353024000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2014,4]]},"DOI":"10.1007\/s00453-012-9715-6","type":"journal-article","created":{"date-parts":[[2012,11,15]],"date-time":"2012-11-15T22:14:49Z","timestamp":1353017689000},"page":"1045-1074","source":"Crossref","is-referenced-by-count":11,"title":["Improved Approximation Algorithms for the Average-Case Tree Searching Problem"],"prefix":"10.1007","volume":"68","author":[{"given":"Ferdinando","family":"Cicalese","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tobias","family":"Jacobs","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eduardo","family":"Laber","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marco","family":"Molinaro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,11,16]]},"reference":[{"key":"9715_CR1","first-page":"145","volume-title":"Proceedings of the Compression and Complexity of Sequences 1997, SEQUENCES\u201997","author":"J. Abrahams","year":"1997","unstructured":"Abrahams, J.: Code and parse trees for lossless source encoding. In: Proceedings of the Compression and Complexity of Sequences 1997, SEQUENCES\u201997, pp. 145\u2013171. IEEE Comput. Soc., Washington (1997)"},{"key":"9715_CR2","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1145\/1109557.1109586","volume-title":"Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA\u201906","author":"M. Adler","year":"2006","unstructured":"Adler, M., Demaine, E.D., Harvey, N.J.A., P\u01cetra\u015fcu, M.: Lower bounds for asymmetric communication channels and distributed source coding. In: Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA\u201906, pp. 251\u2013260. ACM, New York (2006)"},{"key":"9715_CR3","first-page":"1","volume-title":"Proceedings of the 11th International Workshop, APPROX 2008, and 12th International Workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques, APPROX\u201908\/RANDOM\u201908","author":"M. Adler","year":"2008","unstructured":"Adler, M., Heeringa, B.: Approximating optimal binary decision trees. In: Proceedings of the 11th International Workshop, APPROX 2008, and 12th International Workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques, APPROX\u201908\/RANDOM\u201908, pp. 1\u20139. Springer, Berlin (2008)"},{"issue":"4","key":"9715_CR4","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1006\/jcss.2001.1779","volume":"63","author":"M. Adler","year":"2001","unstructured":"Adler, M., Maggs, B.: Protocols for asymmetric communication channels. J.\u00a0Comput. Syst. Sci. 63(4), 573\u2013596 (2001)","journal-title":"J.\u00a0Comput. Syst. Sci."},{"issue":"3","key":"9715_CR5","doi-asserted-by":"crossref","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. J. Comput. Geom. Appl. 8(3), 343\u2013364 (1998)","journal-title":"Int. J. Comput. Geom. Appl."},{"issue":"6","key":"9715_CR6","doi-asserted-by":"crossref","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 J. Comput. 28(6), 2090\u20132102 (1999)","journal-title":"SIAM J. Comput."},{"key":"9715_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1921659.1921661","volume":"15","author":"V.T. Chakaravarthy","year":"2011","unstructured":"Chakaravarthy, V.T., Pandit, V., Roy, S., Awasthi, P., Mohania, M.K.: Decision trees for entity identification: approximation algorithms and hardness results. ACM Trans. Algorithms 15, 1 (2011)","journal-title":"ACM Trans. Algorithms"},{"key":"9715_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1007\/978-3-642-17514-5_18","volume-title":"Proceedings of the 21st International Symposium on Algorithms and Computation (ISAAC 2010)","author":"F. Cicalese","year":"2010","unstructured":"Cicalese, F., Jacobs, T., Laber, E., Molinaro, M.: On greedy algorithms for decision trees. In: Proceedings of the 21st International Symposium on Algorithms and Computation (ISAAC 2010). Lecture Notes in Computer Science, vol. 6507, pp. 206\u2013217. Springer, Berlin (2010)"},{"key":"9715_CR9","doi-asserted-by":"crossref","first-page":"6879","DOI":"10.1016\/j.tcs.2011.08.042","volume":"412","author":"F. Cicalese","year":"2011","unstructured":"Cicalese, F., Jacobs, T., Laber, E.S., Molinaro, M.: On the complexity of searching in trees and partially ordered structures. Theor. Comput. Sci. 412, 6879\u20136896 (2011)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"9715_CR10","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1137\/070697720","volume":"40","author":"C. Daskalakis","year":"2011","unstructured":"Daskalakis, C., Karp, R.M., Mossel, E., Riesenfeld, S.J., Verbin, E.: Sorting and selection in posets. SIAM J. Comput. 40(3), 597\u2013622 (2011)","journal-title":"SIAM J. Comput."},{"issue":"6","key":"9715_CR11","doi-asserted-by":"crossref","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 13(6), 592\u2013618 (1995)","journal-title":"Algorithmica"},{"issue":"13","key":"9715_CR12","doi-asserted-by":"crossref","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. Discrete Appl. Math. 156(13), 2493\u20132500 (2008)","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"9715_CR13","doi-asserted-by":"crossref","first-page":"1075","DOI":"10.1137\/0215077","volume":"15","author":"U. Faigle","year":"1986","unstructured":"Faigle, U., Lov\u00e1sz, L., Schrader, R., Tur\u00e1n, G.: Searching in trees, series-parallel and interval orders. SIAM J. Comput. 15(4), 1075\u20131084 (1986)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"9715_CR14","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. SIAM J. Appl. Math. 23(2), 173\u2013186 (1972)","journal-title":"SIAM J. Appl. Math."},{"issue":"4","key":"9715_CR15","doi-asserted-by":"crossref","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 J. Comput. 6(4), 622\u2013642 (1977)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"9715_CR16","first-page":"297","volume":"8","author":"S. Ghazizadeh","year":"2001","unstructured":"Ghazizadeh, S., Ghodsi, M., Saberi, A.: A new protocol for asymmetric communication channels: reaching the lower bounds. Sci. Iran. 8(4), 297\u2013302 (2001)","journal-title":"Sci. Iran."},{"issue":"4","key":"9715_CR17","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1137\/0121057","volume":"21","author":"T. Hu","year":"1971","unstructured":"Hu, T., Tucker, A.: Optimal computer search trees and variable-length alphabetic codes. SIAM J. Appl. Math. 21(4), 514\u2013532 (1971)","journal-title":"SIAM J. Appl. Math."},{"issue":"1","key":"9715_CR18","doi-asserted-by":"crossref","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. Inf. Process. Lett. 5(1), 15\u201317 (1976)","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"9715_CR19","first-page":"463","volume":"22","author":"O. Ibarra","year":"1975","unstructured":"Ibarra, O., Kim, C.: Fast approximation algorithms for the knapsack and sum of subset problems. J.\u00a0ACM 22(4), 463\u2013468 (1975)","journal-title":"J.\u00a0ACM"},{"issue":"1","key":"9715_CR20","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/0166-218X(91)90012-L","volume":"30","author":"A. Iyer","year":"1991","unstructured":"Iyer, A., Ratliff, H., Vijayan, G.: On an edge ranking problem of trees and graphs. Discrete Appl. Math. 30(1), 43\u201352 (1991)","journal-title":"Discrete Appl. Math."},{"key":"9715_CR21","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1007\/978-3-642-14165-2_45","volume-title":"Proceedings of the 37th International Colloquium Conference on Automata, Languages and Programming, ICALP\u201910","author":"T. Jacobs","year":"2010","unstructured":"Jacobs, T., Cicalese, F., Laber, E., Molinaro, M.: On the complexity of searching in trees: average-case minimization. In: Proceedings of the 37th International Colloquium Conference on Automata, Languages and Programming, ICALP\u201910, pp. 527\u2013539. Springer, Berlin (2010)"},{"key":"9715_CR22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.tcs.2012.09.026","volume":"465","author":"T. Jacobs","year":"2012","unstructured":"Jacobs, T.: Analytical aspects of tie breaking. Theor. Comput. Sci. 465, 1\u20139 (2012)","journal-title":"Theor. Comput. Sci."},{"key":"9715_CR23","volume-title":"The Art of Computer Programming. Vol. 3: Sorting and Searching","author":"D. Knuth","year":"1973","unstructured":"Knuth, D.: The Art of Computer Programming. Vol. 3: Sorting and Searching. Addison-Wesley, Reading (1973)"},{"key":"9715_CR24","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/3-540-48447-7_17","volume-title":"Proceedings of the 6th International Workshop on Algorithms and Data Structures, WADS\u201999","author":"S.R. Kosaraju","year":"1999","unstructured":"Kosaraju, S.R., Przytycka, T.M., Borgstrom, R.S.: On an optimal split tree problem. In: Proceedings of the 6th International Workshop on Algorithms and Data Structures, WADS\u201999, pp. 157\u2013168. Springer, London (1999)"},{"issue":"4","key":"9715_CR25","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/S0020-0190(01)00332-5","volume":"83","author":"E. Laber","year":"2002","unstructured":"Laber, E., Holanda, L.: Improved bounds for asymmetric communication protocols. Inf. Process. Lett. 83(4), 205\u2013209 (2002)","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"9715_CR26","doi-asserted-by":"crossref","first-page":"601","DOI":"10.1007\/s00453-009-9325-0","volume":"59","author":"E. Laber","year":"2011","unstructured":"Laber, E., Molinaro, M.: An approximation algorithm for binary searching in trees. Algorithmica 59(4), 601\u2013620 (2011)","journal-title":"Algorithmica"},{"issue":"1\u20132","key":"9715_CR27","doi-asserted-by":"crossref","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 Appl. Math. 144(1\u20132), 209\u2013212 (2004)","journal-title":"Discrete Appl. Math."},{"key":"9715_CR28","first-page":"436","volume-title":"Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA\u201998","author":"T.W. Lam","year":"1998","unstructured":"Lam, T.W., Yue, F.L.: Optimal edge ranking of trees in linear time. In: Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA\u201998, pp. 436\u2013445. Society for Industrial and Applied Mathematics, Philadelphia (1998)"},{"key":"9715_CR29","unstructured":"Larmore, H., Hirschberg, D.S., Larmore, L.L., Molodowitch, M.: Subtree weight ratios for optimal binary search trees. Technical report 86-0200-2, Bren School of Information and Computer Science, UC Irvine (1986)"},{"issue":"1","key":"9715_CR30","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/0196-6774(85)90020-3","volume":"6","author":"N. Linial","year":"1985","unstructured":"Linial, N., Saks, M.: Searching ordered structures. J.\u00a0Algorithms 6(1), 86\u2013103 (1985)","journal-title":"J.\u00a0Algorithms"},{"issue":"1","key":"9715_CR31","doi-asserted-by":"crossref","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 Trans. Inf. Theory 41(1), 287\u2013291 (1995)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9715_CR32","first-page":"1096","volume-title":"Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA\u201908","author":"S. Mozes","year":"2008","unstructured":"Mozes, S., Onak, K., Weimann, O.: Finding an optimal tree searching strategy in linear time. In: Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA\u201908, pp.\u00a01096\u20131105. Society for Industrial and Applied Mathematics, Philadelphia (2008)"},{"key":"9715_CR33","first-page":"379","volume-title":"Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science, FOCS\u201906","author":"K. Onak","year":"2006","unstructured":"Onak, K., Parys, P.: Generalization of binary search: Searching in trees and forest-like partial orders. In: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science, FOCS\u201906, pp. 379\u2013388. IEEE Comput. Soc., Washington (2006)"},{"issue":"2","key":"9715_CR34","doi-asserted-by":"crossref","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. Inf. Process. Lett. 33(2), 91\u201396 (1989)","journal-title":"Inf. Process. Lett."},{"key":"9715_CR35","series-title":"Proceedings in Informatics","first-page":"337","volume-title":"Proceedings of the 8th International Colloquium on Structural Information and Communication Complexity, SIROCCO","author":"J. Watkinson","year":"2001","unstructured":"Watkinson, J., Adler, M., Fich, F.E.: New protocols for asymmetric communication channels. In: Proceedings of the 8th International Colloquium on Structural Information and Communication Complexity, SIROCCO. Proceedings in Informatics, vol. 8, pp. 337\u2013350. Carleton Scientific, Kitchener (2001)"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-012-9715-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-012-9715-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-012-9715-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,31]],"date-time":"2022-01-31T12:12:41Z","timestamp":1643631161000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-012-9715-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,11,16]]},"references-count":35,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2014,4]]}},"alternative-id":["9715"],"URL":"https:\/\/doi.org\/10.1007\/s00453-012-9715-6","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,11,16]]}}}