You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output.
Click here to find out more.
Chapter title |
On the Hardness of Constructing Minimal 2-Connected Spanning Subgraphs in Complete Graphs with Sharpened Triangle Inequality
|
---|---|
Chapter number | 7 |
Book title |
FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science
|
Published by |
Springer Berlin Heidelberg, January 2002
|
DOI | 10.1007/3-540-36206-1_7 |
Book ISBNs |
978-3-54-000225-3, 978-3-54-036206-7
|
Authors |
Hans-Joachim Böckenhauer, Dirk Bongartz, Juraj Hromkovič, Ralf Klasing, Guido Proietti, Sebastian Seibert, Walter Unger, Böckenhauer, Hans-Joachim, Bongartz, Dirk, Hromkovič, Juraj, Klasing, Ralf, Proietti, Guido, Seibert, Sebastian, Unger, Walter |
Editors |
Manindra Agrawal, Anil Seth |