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. 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
{"_id":"NYDBGAbzZXB6wre83","bibbaseid":"flammini-moscardelli-shalom-zaks-approximatingthetrafficgroomingproblem-2005","author_short":["Flammini, M.","Moscardelli, L.","Shalom, M.","Zaks, S."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["Michele"],"propositions":[],"lastnames":["Flammini"],"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","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","bibtex":"@inproceedings{DBLP:conf/isaac/FlamminiMFZ05,\n author = {Michele Flammini and\n Luca Moscardelli and\n Mordechai Shalom and\n Shmuel Zaks},\n title = {Approximating the Traffic Grooming Problem},\n booktitle = {Algorithms and Computation, 16th International Symposium, {ISAAC}\n 2005, Sanya, Hainan, China, December 19-21, 2005, Proceedings},\n pages = {915--924},\n year = {2005},\n crossref = {DBLP:conf/isaac/2005},\n url = {https://doi.org/10.1007/11602613\\_91},\n doi = {10.1007/11602613\\_91},\n timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},\n biburl = {https://dblp.org/rec/conf/isaac/FlamminiMFZ05.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n","author_short":["Flammini, M.","Moscardelli, L.","Shalom, M.","Zaks, S."],"key":"DBLP:conf/isaac/FlamminiMFZ05","id":"DBLP:conf/isaac/FlamminiMFZ05","bibbaseid":"flammini-moscardelli-shalom-zaks-approximatingthetrafficgroomingproblem-2005","role":"author","urls":{"Paper":"https://doi.org/10.1007/11602613\\_91"},"metadata":{"authorlinks":{}}},"bibtype":"inproceedings","biburl":"https://dblp.uni-trier.de/pers/tb2/f/Flammini:Michele.bib","dataSources":["Apmxrn2k8d9m58buk"],"keywords":[],"search_terms":["approximating","traffic","grooming","problem","flammini","moscardelli","shalom","zaks"],"title":"Approximating the Traffic Grooming Problem","year":2005}