Approximating the Traffic Grooming Problem. Flammini, M., Moscardelli, L., Shalom, M., & Zaks, S. In Algorithms and Computation, 16th International Symposium, ISAAC 2005, Sanya, Hainan, China, December 19-21, 2005, Proceedings, pages 915–924, 2005.
Approximating the Traffic Grooming Problem [link]Paper  doi  bibtex   
@inproceedings{DBLP:conf/isaac/FlamminiMFZ05,
  author    = {Michele Flammini and
               Luca Moscardelli and
               Mordechai Shalom and
               Shmuel Zaks},
  title     = {Approximating the Traffic Grooming Problem},
  booktitle = {Algorithms and Computation, 16th International Symposium, {ISAAC}
               2005, Sanya, Hainan, China, December 19-21, 2005, Proceedings},
  pages     = {915--924},
  year      = {2005},
  crossref  = {DBLP:conf/isaac/2005},
  url       = {https://doi.org/10.1007/11602613\_91},
  doi       = {10.1007/11602613\_91},
  timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/conf/isaac/FlamminiMFZ05.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

Downloads: 0