%0 Conference Paper %1 conf/aaim/ChenHJ05 %A Chen, Xujin %A Hu, Xiao-Dong %A Jia, Xiaohua %B AAIM %D 2005 %E Megiddo, Nimrod %E Xu, Yinfeng %E Zhu, Binhai %I Springer %K dblp %P 6-15 %T Complexity of Minimal Tree Routing and Coloring. %U http://dblp.uni-trier.de/db/conf/aaim/aaim2005.html#ChenHJ05 %V 3521 %@ 3-540-26224-5

@inproceedings{conf/aaim/ChenHJ05, added-at = {2019-12-10T00:00:00.000+0100}, author = {Chen, Xujin and Hu, Xiao-Dong and Jia, Xiaohua}, biburl = {https://www.bibsonomy.org/bibtex/2a941db973ea68ab70083dbefd8df5701/dblp}, booktitle = {AAIM}, crossref = {conf/aaim/2005}, editor = {Megiddo, Nimrod and Xu, Yinfeng and Zhu, Binhai}, ee = {https://doi.org/10.1007/11496199_3}, interhash = {dd1f17fdb38da9102bce580002ded375}, intrahash = {a941db973ea68ab70083dbefd8df5701}, isbn = {3-540-26224-5}, keywords = {dblp}, pages = {6-15}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2019-12-11T11:40:02.000+0100}, title = {Complexity of Minimal Tree Routing and Coloring.}, url = {http://dblp.uni-trier.de/db/conf/aaim/aaim2005.html#ChenHJ05}, volume = 3521, year = 2005 }