{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T05:00:54Z","timestamp":1648616454791},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,10,20]],"date-time":"2013-10-20T00:00:00Z","timestamp":1382227200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2015,10]]},"DOI":"10.1007\/s10878-013-9666-0","type":"journal-article","created":{"date-parts":[[2013,10,19]],"date-time":"2013-10-19T04:22:22Z","timestamp":1382156542000},"page":"768-802","source":"Crossref","is-referenced-by-count":1,"title":["Heuristics for the data arrangement problem on regular trees"],"prefix":"10.1007","volume":"30","author":[{"given":"Eranda","family":"\u00c7ela","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rostislav","family":"Stan\u011bk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,10,20]]},"reference":[{"key":"9666_CR1","doi-asserted-by":"crossref","unstructured":"\u00c7ela E, Stan\u011bk R (2013) Polynomially solvable special cases of the data arrangement problem on regular trees, working paper","DOI":"10.1007\/s10878-013-9666-0"},{"key":"9666_CR2","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/0898-1221(84)90085-3","volume":"10","author":"FRK Chung","year":"1984","unstructured":"Chung FRK (1984) An optimal linear arrangement of trees. Comput Math Appl 10:43\u201360","journal-title":"Comput Math Appl"},{"key":"9666_CR3","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1016\/S0166-218X(02)00394-3","volume":"127","author":"U Feige","year":"2003","unstructured":"Feige U, Krauthgamer R, Nissim K (2003) On cutting a few vertices from a graph. Discret Appl Math 127:643\u2013649","journal-title":"Discret Appl Math"},{"key":"9666_CR4","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. Series of books in the mathematical sciences, p 210"},{"key":"9666_CR5","doi-asserted-by":"crossref","unstructured":"Juvan M, Mohar B (1992) Optimal linear labelings and eigenvalues of graphs. Discret Appl Math 36(2): 153\u2013168","DOI":"10.1016\/0166-218X(92)90229-4"},{"issue":"1\u20133","key":"9666_CR6","first-page":"307","volume":"121","author":"MJ Luzcak","year":"1992","unstructured":"Luzcak MJ, Noble SD (1992) Optimal arrangement of data in a tree directory. Discret Appl Math 121(1\u20133):307\u2013315","journal-title":"Discret Appl Math"},{"key":"9666_CR7","unstructured":"Petit J (1998) Approximation heuristics and benchmarkings for the MinLA problem. In: Battiti R, Bertossi A (eds) Algorithms and experiments (ALEX98)\u2014Building bridges between theory and applications, pp 112\u2013128"},{"key":"9666_CR8","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1145\/996546.996554","volume":"8","author":"J Petit","year":"2003","unstructured":"Petit J (2003) Experiments on the minimum linear arrangement problem. ACM J Exp Algorithm 8:307\u2013315","journal-title":"ACM J Exp Algorithm"},{"key":"9666_CR9","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1137\/0208002","volume":"8","author":"Y Shiloach","year":"1979","unstructured":"Shiloach Y (1979) A minimum linear arrangement algorithm for undirected trees. SIAM J Comput 8:15\u201322","journal-title":"SIAM J Comput"},{"key":"9666_CR10","unstructured":"Stan\u011bk R (2012) Heuristiken f\u00fcr das optimale data-arrangement-problem in einem baum. Master\u2019s thesis, Graz Univeristy of Technology, in German"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9666-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-013-9666-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9666-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,9]],"date-time":"2022-03-09T17:33:22Z","timestamp":1646847202000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-013-9666-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,10,20]]},"references-count":10,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,10]]}},"alternative-id":["9666"],"URL":"https:\/\/doi.org\/10.1007\/s10878-013-9666-0","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,10,20]]}}}