Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks. Approximating the Traffic Grooming Problem in Tree and Star Networks. In Fedor V. Fomin, editor, Graph-Theoretic Concepts in Computer Science, 32nd International Workshop, WG 2006, Bergen, Norway, June 22-24, 2006, Revised Papers. Volume 4271 of Lecture Notes in Computer Science, pages 147-158, Springer, 2006. [doi]
@inproceedings{FlamminiMMSZ06,
title = {Approximating the Traffic Grooming Problem in Tree and Star Networks},
author = {Michele Flammini and Gianpiero Monaco and Luca Moscardelli and Mordechai Shalom and Shmuel Zaks},
year = {2006},
doi = {10.1007/11917496_14},
url = {http://dx.doi.org/10.1007/11917496_14},
researchr = {https://researchr.org/publication/FlamminiMMSZ06},
cites = {0},
citedby = {0},
pages = {147-158},
booktitle = {Graph-Theoretic Concepts in Computer Science, 32nd International Workshop, WG 2006, Bergen, Norway, June 22-24, 2006, Revised Papers},
editor = {Fedor V. Fomin},
volume = {4271},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-48381-0},
}