scientific article; zbMATH DE number 1405676

zbMATH Open0955.68085MaRDI QIDQ4938657FDOQ4938657

Authors: Hiroshi Nagamochi, Toshihide Ibaraki 

Publication date: 23 February 2000

Title of this publication is not available (Why is that?)

Recommendations

• An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree
• A 4/3-approximation algorithm for the minimum 2-edge connected subgraph problem
• scientific article; zbMATH DE number 1187147
• scientific article; zbMATH DE number 1833404
• Improving on the 1. 5-approximation of a smallest 2-edge connected spanning subgraph

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Cited In (5)

• Algorithms and Computation
• Title not available (Why is that?)
• An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree
• Edge capacity augmentation problem on spanning trees in networks
• Title not available (Why is that?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4938657)