Hardness and Approximation Results for Packing Steiner Trees

Joseph Cheriyan, Mohammad R. Salavatipour. Hardness and Approximation Results for Packing Steiner Trees. In Susanne Albers, Tomasz Radzik, editors, Algorithms - ESA 2004, 12th Annual European Symposium, Bergen, Norway, September 14-17, 2004, Proceedings. Volume 3221 of Lecture Notes in Computer Science, pages 180-191, Springer, 2004. [doi]

@inproceedings{CheriyanS04,
  title = {Hardness and Approximation Results for Packing Steiner Trees},
  author = {Joseph Cheriyan and Mohammad R. Salavatipour},
  year = {2004},
  url = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=3221&spage=180},
  researchr = {https://researchr.org/publication/CheriyanS04},
  cites = {0},
  citedby = {0},
  pages = {180-191},
  booktitle = {Algorithms - ESA 2004, 12th Annual European Symposium, Bergen, Norway, September 14-17, 2004, Proceedings},
  editor = {Susanne Albers and Tomasz Radzik},
  volume = {3221},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-23025-4},
}