%0 Journal Article %1 journals/jal/ChenDHX03 %A Chen, Danny Z. %A Daescu, Ovidiu %A Hu, Xiaobo %A Xu, Jinhui %D 2003 %J J. Algorithms %K dblp %N 1 %P 13-41 %T Finding an optimal path without growing the tree. %U http://dblp.uni-trier.de/db/journals/jal/jal49.html#ChenDHX03 %V 49

@article{journals/jal/ChenDHX03, added-at = {2018-11-02T00:00:00.000+0100}, author = {Chen, Danny Z. and Daescu, Ovidiu and Hu, Xiaobo and Xu, Jinhui}, biburl = {https://puma.ub.uni-stuttgart.de/bibtex/2f7f9b88836365900a565c0ef245f13fe/dblp}, ee = {https://doi.org/10.1016/S0196-6774(03)00080-4}, interhash = {b995e3bb7cd30260998d7c7788e92710}, intrahash = {f7f9b88836365900a565c0ef245f13fe}, journal = {J. Algorithms}, keywords = {dblp}, number = 1, pages = {13-41}, timestamp = {2019-09-27T12:03:41.000+0200}, title = {Finding an optimal path without growing the tree.}, url = {http://dblp.uni-trier.de/db/journals/jal/jal49.html#ChenDHX03}, volume = 49, year = 2003 }