Approximation Algorithms for Packing Element-Disjoint Steiner Trees on Bounded Terminal Nodes

Daiki Hoshika, Eiji Miyano. Approximation Algorithms for Packing Element-Disjoint Steiner Trees on Bounded Terminal Nodes. In Qianping Gu, Pavol Hell, Boting Yang, editors, Algorithmic Aspects in Information and Management - 10th International Conference, AAIM 2014, Vancouver, BC, Canada, July 8-11, 2014. Proceedings. Volume 8546 of Lecture Notes in Computer Science, pages 100-111, Springer, 2014. [doi]

@inproceedings{HoshikaM14,
  title = {Approximation Algorithms for Packing Element-Disjoint Steiner Trees on Bounded Terminal Nodes},
  author = {Daiki Hoshika and Eiji Miyano},
  year = {2014},
  doi = {10.1007/978-3-319-07956-1_10},
  url = {http://dx.doi.org/10.1007/978-3-319-07956-1_10},
  researchr = {https://researchr.org/publication/HoshikaM14},
  cites = {0},
  citedby = {0},
  pages = {100-111},
  booktitle = {Algorithmic Aspects in Information and Management - 10th International Conference, AAIM 2014, Vancouver, BC, Canada, July 8-11, 2014. Proceedings},
  editor = {Qianping Gu and Pavol Hell and Boting Yang},
  volume = {8546},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-319-07955-4},
}