{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T06:17:00Z","timestamp":1725862620357},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662531730"},{"type":"electronic","value":"9783662531747"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-662-53174-7_7","type":"book-chapter","created":{"date-parts":[[2016,8,4]],"date-time":"2016-08-04T14:50:06Z","timestamp":1470322206000},"page":"90-102","source":"Crossref","is-referenced-by-count":0,"title":["On the Tree Search Problem with Non-uniform Costs"],"prefix":"10.1007","author":[{"given":"Ferdinando","family":"Cicalese","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bal\u00e1zs","family":"Keszegh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bernard","family":"Lidick\u00fd","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D\u00f6m\u00f6t\u00f6r","family":"P\u00e1lv\u00f6lgyi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tom\u00e1\u0161","family":"Valla","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,8,5]]},"reference":[{"key":"7_CR1","volume-title":"Search Problems","author":"R Ahlswede","year":"1987","unstructured":"Ahlswede, R., Wegener, I.: Search Problems. Wiley, Chichester-New York (1987)"},{"key":"7_CR2","volume-title":"Combinatorial Search","author":"M Aigner","year":"1988","unstructured":"Aigner, M.: Combinatorial Search. Wiley-Teubner, New York-Stuttgart (1988)"},{"issue":"6","key":"7_CR3","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":"7_CR4","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1016\/j.tcs.2012.06.023","volume":"459","author":"F Cicalese","year":"2012","unstructured":"Cicalese, F., Jacobs, T., Laber, E., Valentim, C.: The binary identification problem for weighted trees. Theor. Comput. Sci. 459, 100\u2013112 (2012)","journal-title":"Theor. Comput. Sci."},{"issue":"6","key":"7_CR5","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"},{"key":"7_CR6","doi-asserted-by":"crossref","first-page":"1198","DOI":"10.1016\/j.dam.2005.11.005","volume":"154","author":"D Dereniowski","year":"2006","unstructured":"Dereniowski, D.: Edge ranking of weighted trees. Discrete Appl. Math. 154, 1198\u20131209 (2006)","journal-title":"Discrete Appl. Math."},{"issue":"13","key":"7_CR7","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."},{"key":"7_CR8","volume-title":"Computer and Intractability","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computer and Intractability. W.H. Freeman & Co., New York (1979)"},{"issue":"1","key":"7_CR9","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/0166-218X(91)90012-L","volume":"30","author":"AV Iyer","year":"1991","unstructured":"Iyer, A.V., Ratliff, H.D., 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":"7_CR10","series-title":"The Art of Computer Programming","volume-title":"Searching and Sorting","author":"D Knuth","year":"1998","unstructured":"Knuth, D.: Searching and Sorting. The Art of Computer Programming, vol. 3. Addison-Wesley, Reading (1998)"},{"key":"7_CR11","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 1998, pp. 436\u2013445, Philadelphia, PA, USA, Society for Industrial and Applied Mathematics (1998)"},{"key":"7_CR12","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 order structures. J. Algorithms 6, 86\u2013103 (1985)","journal-title":"J. Algorithms"},{"key":"7_CR13","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1006\/jagm.2000.1143","volume":"38","author":"K Makino","year":"2001","unstructured":"Makino, K., Uno, Y., Ibaraki, T.: On minimum edge ranking spanning trees. J. Algorithms 38, 411\u2013437 (2001)","journal-title":"J. Algorithms"},{"key":"7_CR14","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 2008), pp. 1096\u20131105 (2008)"},{"key":"7_CR15","unstructured":"Wermelinger, M.: Searching Efficiently in Posets. New University of Lisbon, Topics in Programming Technology (1993)"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-53174-7_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T19:57:43Z","timestamp":1498334263000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-53174-7_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662531730","9783662531747"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-53174-7_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}