BibTeX record conf/fun/ShalomUZ07

• > Home > conf/fun/ShalomUZ07

@inproceedings{DBLP:conf/fun/ShalomUZ07,
  author       = {Mordechai Shalom and
                  Walter Unger and
                  Shmuel Zaks},
  editor       = {Pierluigi Crescenzi and
                  Giuseppe Prencipe and
                  Geppino Pucci},
  title        = {On the Complexity of the Traffic Grooming Problem in Optical Networks},
  booktitle    = {Fun with Algorithms, 4th International Conference, {FUN} 2007, Castiglioncello,
                  Italy, June 3-5, 2007, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {4475},
  pages        = {262--271},
  publisher    = {Springer},
  year         = {2007},
  url          = {https://doi.org/10.1007/978-3-540-72914-3\_23},
  doi          = {10.1007/978-3-540-72914-3\_23},
  timestamp    = {Tue, 14 May 2019 10:00:45 +0200},
  biburl       = {https://dblp.org/rec/conf/fun/ShalomUZ07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}