%0 Conference Paper %1 conf/soict/HieuQN11 %A Nguyen, Minh Hieu %A Quoc, PhanTan %A Nghia, Nguyen Duc %B SoICT %D 2011 %E Thang, Huynh Quyet %E Tran, Dinh Khang %I ACM %K dblp %P 5-10 %T An approach of ant algorithm for solving minimum routing cost spanning tree problem. %U http://dblp.uni-trier.de/db/conf/soict/soict2011.html#HieuQN11 %@ 978-1-4503-0880-9

@inproceedings{conf/soict/HieuQN11, added-at = {2020-09-25T00:00:00.000+0200}, author = {Nguyen, Minh Hieu and Quoc, PhanTan and Nghia, Nguyen Duc}, biburl = {https://www.bibsonomy.org/bibtex/28908fc2812a16b063dd5dc8bcead7cf4/dblp}, booktitle = {SoICT}, crossref = {conf/soict/2011}, editor = {Thang, Huynh Quyet and Tran, Dinh Khang}, ee = {https://doi.org/10.1145/2069216.2069222}, interhash = {176e1a6398b8f136e26c9bd5d09d0de1}, intrahash = {8908fc2812a16b063dd5dc8bcead7cf4}, isbn = {978-1-4503-0880-9}, keywords = {dblp}, pages = {5-10}, publisher = {ACM}, timestamp = {2020-09-26T11:35:19.000+0200}, title = {An approach of ant algorithm for solving minimum routing cost spanning tree problem.}, url = {http://dblp.uni-trier.de/db/conf/soict/soict2011.html#HieuQN11}, year = 2011 }