An Approximation for Finding a Smallest 2-Edge-Connected Subgraph Containing a Specified Spanning Tree

Hiroshi Nagamochi, Toshihide Ibaraki. An Approximation for Finding a Smallest 2-Edge-Connected Subgraph Containing a Specified Spanning Tree. In COCOON. pages 31-40, 1999. [doi]

Authors

Hiroshi Nagamochi

This author has not been identified. Look up 'Hiroshi Nagamochi' in Google

Toshihide Ibaraki

This author has not been identified. Look up 'Toshihide Ibaraki' in Google