On the Hardness of Constructing Minimal 2-Connected Spanning Subgraphs in Complete Graphs with Sharpened Triangle Inequality - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Hans-Joachim Böckenhauer, Dirk Bongartz, Juraj Hromkovic, Ralf Klasing, Guido Proietti, Sebastian Seibert, Walter Unger. On the Hardness of Constructing Minimal 2-Connected Spanning Subgraphs in Complete Graphs with Sharpened Triangle Inequality. In Manindra Agrawal, Anil Seth, editors, FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science, 22nd Conference Kanpur, India, December 12-14, 2002, Proceedings. Volume 2556 of Lecture Notes in Computer Science, pages 59-70, Springer, 2002. [doi]

This author has not been identified. Look up 'Hans-Joachim Böckenhauer' in GoogleThis author has not been identified. Look up 'Dirk Bongartz' in GoogleThis author has not been identified. Look up 'Juraj Hromkovic' in GoogleThis author has not been identified. Look up 'Ralf Klasing' in GoogleThis author has not been identified. Look up 'Guido Proietti' in GoogleThis author has not been identified. Look up 'Sebastian Seibert' in GoogleThis author has not been identified. Look up 'Walter Unger' in Google

runs on WebDSL