Linear Programming Hierarchies Suffice for Directed Steiner Tree - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Zachary Friggstad, Jochen Könemann, Young Kun-Ko, Anand Louis, Mohammad Shadravan, Madhur Tulsiani. Linear Programming Hierarchies Suffice for Directed Steiner Tree. In Jon Lee, Jens Vygen, editors, Integer Programming and Combinatorial Optimization - 17th International Conference, IPCO 2014, Bonn, Germany, June 22-24, 2014. Proceedings. Volume 8494 of Lecture Notes in Computer Science, pages 285-296, Springer, 2014. [doi]

This author has not been identified. Look up 'Zachary Friggstad' in GoogleThis author has not been identified. Look up 'Jochen Könemann' in GoogleThis author has not been identified. Look up 'Young Kun-Ko' in GoogleThis author has not been identified. Look up 'Anand Louis' in GoogleThis author has not been identified. Look up 'Mohammad Shadravan' in GoogleThis author has not been identified. Look up 'Madhur Tulsiani' in Google

runs on WebDSL