{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T07:27:50Z","timestamp":1648884470680},"reference-count":14,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. ^|^ Syst."],"published-print":{"date-parts":[[2015]]},"DOI":"10.1587\/transinf.2014edp7009","type":"journal-article","created":{"date-parts":[[2015,1,5]],"date-time":"2015-01-05T07:25:06Z","timestamp":1420442706000},"page":"103-107","source":"Crossref","is-referenced-by-count":0,"title":["Algorithm for the Length-Constrained Maximum-Density Path Problem in a Tree with Uniform Edge Lengths"],"prefix":"10.1587","volume":"E98.D","author":[{"given":"Sung Kwon","family":"KIM","sequence":"first","affiliation":[{"name":"School of Computer Science and Engineering, Chung-Ang University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"crossref","unstructured":"[1] B. Bhattacharyya and F. Dehne, \u201cUsing spine decompositions to efficiently solve the length-constrained heaviest path problem for trees,\u201d Inf. Process. Lett., vol.108, pp.293-297, 2008.","DOI":"10.1016\/j.ipl.2008.05.023"},{"key":"2","doi-asserted-by":"crossref","unstructured":"[2] K.M. Chung and H.I. Lu, \u201cAn optimal algorithm for the maximum-density segment problem,\u201d SIAM J. Comput., vol.34, pp.373-387, 2004.","DOI":"10.1137\/S0097539704440430"},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] D. Eppstein, \u201cAsymptotic speed-ups in constructive solid geometry,\u201d Algorithmica, vol.13, pp.462-471, 1995.","DOI":"10.1007\/BF01190849"},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] D. Eppstein, \u201cClustering for faster network simplex pivots,\u201d Networks, vol.35, pp.173-180, 2000.","DOI":"10.1002\/(SICI)1097-0037(200005)35:3<173::AID-NET1>3.0.CO;2-W"},{"key":"5","doi-asserted-by":"crossref","unstructured":"[5] G.N. Frederickson, \u201cData structures for on-line updating of minimum spanning trees, with applications,\u201d SIAM J. Comput., vol.14, pp.781-798, 1985.","DOI":"10.1137\/0214055"},{"key":"6","doi-asserted-by":"crossref","unstructured":"[6] D. Harel and R.E. Tarjan, \u201cFast algorithms for finding nearest common ancestors,\u201d SIAM J. Comput., vol.13, no.2, pp.338-355, 1984.","DOI":"10.1137\/0213024"},{"key":"7","doi-asserted-by":"crossref","unstructured":"[7] X. Huang, \u201cAn algorithm for identifying regions of a DNA sequence that satisfy a content requirement,\u201d Comput. Appl. Biosci., vol.10, pp.219-225, 1994.","DOI":"10.1093\/bioinformatics\/10.3.219"},{"key":"8","doi-asserted-by":"crossref","unstructured":"[8] G.F. Italiano and R. Ramaswami, \u201cMaintaining spanning trees of small diameter,\u201d Algorithmica, vol.2, pp.275-304, 1998.","DOI":"10.1007\/PL00009225"},{"key":"9","doi-asserted-by":"crossref","unstructured":"[9] S.K. Kim, \u201cLinear-time algorithm for the length-constrained heaviest path problem in a tree with uniform edge lengths,\u201d IEICE Trans. Inf. &amp; Syst., vol.E96-D, no.3, pp.498-501, March 2013.","DOI":"10.1587\/transinf.E96.D.498"},{"key":"10","doi-asserted-by":"crossref","unstructured":"[10] H.C. Lau, T.H. Ngo, and B.N. Nguyen, \u201cFinding a length-constrained maximum-sum or maximum-density subtree and its application to logistics,\u201d Discrete Optim., vol.3, pp.385-391, 2006.","DOI":"10.1016\/j.disopt.2006.06.002"},{"key":"11","doi-asserted-by":"crossref","unstructured":"[11] R.R. Lin, W.H. Kuo, and K.M. Chao, \u201cFinding a length-constrained maximum-density path in a tree,\u201d J. Comb. Optim., vol.9, pp.147-156, 2005.","DOI":"10.1007\/s10878-005-6853-7"},{"key":"12","doi-asserted-by":"crossref","unstructured":"[12] B. Schieber and U. Vishkin, \u201cOn finding lowest common ancestors: Simplification and parallelization,\u201d SIAM J. Comput., vol.17, pp.1253-1262, 1988.","DOI":"10.1137\/0217079"},{"key":"13","doi-asserted-by":"crossref","unstructured":"[13] A. Tamir, \u201cAn <i>O<\/i>(<i>pn<\/i><sup>2<\/sup>) algorithm for the <i>p<\/i>-median and related problems on tree graphs,\u201d Oper. Res. Lett., vol.19, pp.59-64, 1996.","DOI":"10.1016\/0167-6377(96)00021-1"},{"key":"14","doi-asserted-by":"crossref","unstructured":"[14] B.Y. Wu, K.M. Chao, and C.Y. Tang, \u201cAn efficient algorithm for the length-constrained heaviest path problem on a tree,\u201d Inf. Process. Lett., vol.69, pp.63-67, 1999.","DOI":"10.1016\/S0020-0190(98)00194-X"}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E98.D\/1\/E98.D_2014EDP7009\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,19]],"date-time":"2019-08-19T05:58:09Z","timestamp":1566194289000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E98.D\/1\/E98.D_2014EDP7009\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2014edp7009","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"value":"0916-8532","type":"print"},{"value":"1745-1361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]}}}