Efficient Algorithms for the Prize Collecting Steiner Tree Problems with Interval Data - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Eduardo Álvarez-Miranda' in GoogleThis author has not been identified. Look up 'Alfredo Candia-Véjar' in GoogleThis author has not been identified. Look up 'X. Chen' in GoogleThis author has not been identified. Look up 'X. Hu' in GoogleThis author has not been identified. Look up 'B. Li' in Google

runs on WebDSL