Dae Young Seo, D. T. Lee, Tien-Ching Lin. Geometric Minimum Diameter Minimum Cost Spanning Tree Problem. In Yingfei Dong, Ding-Zhu Du, Oscar H. Ibarra, editors, Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings. Volume 5878 of Lecture Notes in Computer Science, pages 283-292, Springer, 2009. [doi]
@inproceedings{SeoLL09-0, title = {Geometric Minimum Diameter Minimum Cost Spanning Tree Problem}, author = {Dae Young Seo and D. T. Lee and Tien-Ching Lin}, year = {2009}, doi = {10.1007/978-3-642-10631-6_30}, url = {http://dx.doi.org/10.1007/978-3-642-10631-6_30}, researchr = {https://researchr.org/publication/SeoLL09-0}, cites = {0}, citedby = {0}, pages = {283-292}, booktitle = {Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings}, editor = {Yingfei Dong and Ding-Zhu Du and Oscar H. Ibarra}, volume = {5878}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, isbn = {978-3-642-10630-9}, }