Efficient Algorithms for the Prize Collecting Steiner Tree Problems with Interval Data

Eduardo Álvarez-Miranda, Alfredo Candia-Véjar, X. Chen, X. Hu, B. Li. Efficient Algorithms for the Prize Collecting Steiner Tree Problems with Interval Data. In Bo Chen, editor, Algorithmic Aspects in Information and Management, 6th International Conference, AAIM 2010, Weihai, China, July 19-21, 2010. Proceedings. Volume 6124 of Lecture Notes in Computer Science, pages 13-24, Springer, 2010. [doi]

@inproceedings{Alvarez-MirandaCCHL10,
  title = {Efficient Algorithms for the Prize Collecting Steiner Tree Problems with Interval Data},
  author = {Eduardo Álvarez-Miranda and Alfredo Candia-Véjar and X. Chen and X. Hu and B. Li},
  year = {2010},
  doi = {10.1007/978-3-642-14355-7_3},
  url = {http://dx.doi.org/10.1007/978-3-642-14355-7_3},
  tags = {data-flow},
  researchr = {https://researchr.org/publication/Alvarez-MirandaCCHL10},
  cites = {0},
  citedby = {0},
  pages = {13-24},
  booktitle = {Algorithmic Aspects in Information and Management, 6th International Conference, AAIM 2010, Weihai, China, July 19-21, 2010. Proceedings},
  editor = {Bo Chen},
  volume = {6124},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-642-14354-0},
}