%0 Conference Paper %1 conf/icalp/Ambuhl05 %A Ambühl, Christoph %B ICALP %D 2005 %E Caires, Luís %E Italiano, Giuseppe F. %E Monteiro, Luís %E Palamidessi, Catuscia %E Yung, Moti %I Springer %K dblp %P 1139-1150 %T An Optimal Bound for the MST Algorithm to Compute Energy Efficient Broadcast Trees in Wireless Networks. %U http://dblp.uni-trier.de/db/conf/icalp/icalp2005.html#Ambuhl05 %V 3580 %@ 3-540-27580-0

@inproceedings{conf/icalp/Ambuhl05, added-at = {2017-05-23T00:00:00.000+0200}, author = {Ambühl, Christoph}, biburl = {https://www.bibsonomy.org/bibtex/292e014491f8516038096d622f749af91/dblp}, booktitle = {ICALP}, crossref = {conf/icalp/2005}, editor = {Caires, Luís and Italiano, Giuseppe F. and Monteiro, Luís and Palamidessi, Catuscia and Yung, Moti}, ee = {https://doi.org/10.1007/11523468_92}, interhash = {72af0f3a16d817d9a76d9e9e2fb4e950}, intrahash = {92e014491f8516038096d622f749af91}, isbn = {3-540-27580-0}, keywords = {dblp}, pages = {1139-1150}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2019-05-15T16:27:21.000+0200}, title = {An Optimal Bound for the MST Algorithm to Compute Energy Efficient Broadcast Trees in Wireless Networks.}, url = {http://dblp.uni-trier.de/db/conf/icalp/icalp2005.html#Ambuhl05}, volume = 3580, year = 2005 }