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]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.