Davide Bilò, Luciano Gualà, Guido Proietti. Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree. In Petr Hlinený, Antonín Kucera, editors, Mathematical Foundations of Computer Science 2010, 35th International Symposium, MFCS 2010, Brno, Czech Republic, August 23-27, 2010. Proceedings. Volume 6281 of Lecture Notes in Computer Science, pages 138-149, Springer, 2010. [doi]
@inproceedings{BiloGP10, title = {Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree}, author = {Davide Bilò and Luciano Gualà and Guido Proietti}, year = {2010}, doi = {10.1007/978-3-642-15155-2_14}, url = {http://dx.doi.org/10.1007/978-3-642-15155-2_14}, tags = {routing}, researchr = {https://researchr.org/publication/BiloGP10}, cites = {0}, citedby = {0}, pages = {138-149}, booktitle = {Mathematical Foundations of Computer Science 2010, 35th International Symposium, MFCS 2010, Brno, Czech Republic, August 23-27, 2010. Proceedings}, editor = {Petr Hlinený and Antonín Kucera}, volume = {6281}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, isbn = {978-3-642-15154-5}, }