{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,7,21]],"date-time":"2022-07-21T07:31:59Z","timestamp":1658388719330},"reference-count":11,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5311,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1999,1]]},"DOI":"10.1016\/s0166-218x(98)00138-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T19:07:02Z","timestamp":1027624022000},"page":"305-311","source":"Crossref","is-referenced-by-count":2,"title":["Optimal binary trees with order constraints"],"prefix":"10.1016","volume":"91","author":[{"given":"Andr\u00e1s","family":"Seb\u00f6","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zeev","family":"Waksman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(98)00138-3_BIB1","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/0166-218X(90)90098-W","article-title":"On an optimization problem with nested constraints","volume":"26","author":"Dyer","year":"1990","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(98)00138-3_BIB2","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0022-0000(82)90048-4","article-title":"The complexity of selection and ranking in X + Y and matrices with sorted columns","volume":"24","author":"Frederickson","year":"1982","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0166-218X(98)00138-3_BIB3","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/0022-0000(85)90014-5","article-title":"A linear-time algorithm for a special case of disjoint set union","volume":"30","author":"Gabow","year":"1985","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0166-218X(98)00138-3_BIB4","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1145\/322108.322114","article-title":"A fast selection algorithm and the problem of optimum distribution of effort","volume":"26","author":"Galil","year":"1979","journal-title":"J. ACM"},{"key":"10.1016\/S0166-218X(98)00138-3_BIB5","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1287\/moor.19.2.390","article-title":"Lower and upper bounds for the allocation problem and other nonlinear optimization problems","volume":"19","author":"Hochbaum","year":"1994","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0166-218X(98)00138-3_BIB6","first-page":"514","article-title":"Optimal computer search trees and variable-length alphabetical codes","volume":"21","author":"Hu","year":"1971","journal-title":"S1AM J. Appl. Math."},{"key":"10.1016\/S0166-218X(98)00138-3_BIB7","first-page":"1098","article-title":"A method for the construction of minimum redundancy codes","volume":"40","author":"Huffman","year":"1952"},{"key":"10.1016\/S0166-218X(98)00138-3_BIB8","article-title":"The Art of Computer Programming","author":"Knuth","year":"1973"},{"key":"10.1016\/S0166-218X(98)00138-3_BIB9","article-title":"Further remarks on selection problems with nested constraints","author":"Tamir","year":"1979"},{"key":"10.1016\/S0166-218X(98)00138-3_BIB10","doi-asserted-by":"crossref","first-page":"690","DOI":"10.1145\/322154.322161","article-title":"Application of path compression on balanced trees","author":"Tarjan","year":"1979","journal-title":"J. Assoc. Comp. Mash."},{"key":"10.1016\/S0166-218X(98)00138-3_BIB11","article-title":"More on optimization under nested constraints, Ben-Gurion University of the Negev","author":"Waksman","year":"1995","journal-title":"Tech. Report FC 95-06"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X98001383?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X98001383?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T01:50:27Z","timestamp":1555984227000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X98001383"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,1]]},"references-count":11,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1999,1]]}},"alternative-id":["S0166218X98001383"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(98)00138-3","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1999,1]]}}}