@article{DBLP:journals/jpdc/FlamminiMMSZ08,
  author       = {Michele Flammini and
                  Gianpiero Monaco and
                  Luca Moscardelli and
                  Mordechai Shalom and
                  Shmuel Zaks},
  title        = {Approximating the traffic grooming problem in tree and star networks},
  journal      = {J. Parallel Distributed Comput.},
  volume       = {68},
  number       = {7},
  pages        = {939--948},
  year         = {2008},
  url          = {https://doi.org/10.1016/j.jpdc.2008.01.003},
  doi          = {10.1016/J.JPDC.2008.01.003},
  timestamp    = {Sun, 25 Jul 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jpdc/FlamminiMMSZ08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

{"_id":"Xcxchu9eyAFhYnQCa","bibbaseid":"flammini-monaco-moscardelli-shalom-zaks-approximatingthetrafficgroomingproblemintreeandstarnetworks-2008","author_short":["Flammini, M.","Monaco, G.","Moscardelli, L.","Shalom, M.","Zaks, S."],"bibdata":{"bibtype":"article","type":"article","author":[{"firstnames":["Michele"],"propositions":[],"lastnames":["Flammini"],"suffixes":[]},{"firstnames":["Gianpiero"],"propositions":[],"lastnames":["Monaco"],"suffixes":[]},{"firstnames":["Luca"],"propositions":[],"lastnames":["Moscardelli"],"suffixes":[]},{"firstnames":["Mordechai"],"propositions":[],"lastnames":["Shalom"],"suffixes":[]},{"firstnames":["Shmuel"],"propositions":[],"lastnames":["Zaks"],"suffixes":[]}],"title":"Approximating the traffic grooming problem in tree and star networks","journal":"J. Parallel Distributed Comput.","volume":"68","number":"7","pages":"939–948","year":"2008","url":"https://doi.org/10.1016/j.jpdc.2008.01.003","doi":"10.1016/J.JPDC.2008.01.003","timestamp":"Sun, 25 Jul 2021 01:00:00 +0200","biburl":"https://dblp.org/rec/journals/jpdc/FlamminiMMSZ08.bib","bibsource":"dblp computer science bibliography, https://dblp.org","bibtex":"@article{DBLP:journals/jpdc/FlamminiMMSZ08,\n author = {Michele Flammini and\n Gianpiero Monaco and\n Luca Moscardelli and\n Mordechai Shalom and\n Shmuel Zaks},\n title = {Approximating the traffic grooming problem in tree and star networks},\n journal = {J. Parallel Distributed Comput.},\n volume = {68},\n number = {7},\n pages = {939--948},\n year = {2008},\n url = {https://doi.org/10.1016/j.jpdc.2008.01.003},\n doi = {10.1016/J.JPDC.2008.01.003},\n timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},\n biburl = {https://dblp.org/rec/journals/jpdc/FlamminiMMSZ08.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n","author_short":["Flammini, M.","Monaco, G.","Moscardelli, L.","Shalom, M.","Zaks, S."],"key":"DBLP:journals/jpdc/FlamminiMMSZ08","id":"DBLP:journals/jpdc/FlamminiMMSZ08","bibbaseid":"flammini-monaco-moscardelli-shalom-zaks-approximatingthetrafficgroomingproblemintreeandstarnetworks-2008","role":"author","urls":{"Paper":"https://doi.org/10.1016/j.jpdc.2008.01.003"},"metadata":{"authorlinks":{}}},"bibtype":"article","biburl":"https://dblp.uni-trier.de/pers/tb2/f/Flammini:Michele.bib","dataSources":["Apmxrn2k8d9m58buk"],"keywords":[],"search_terms":["approximating","traffic","grooming","problem","tree","star","networks","flammini","monaco","moscardelli","shalom","zaks"],"title":"Approximating the traffic grooming problem in tree and star networks","year":2008}