scientific article; zbMATH DE number 1405676

MaRDI QIDQ4938657zbMATH OpenFDO

Authors Hiroshi Nagamochi, Toshihide Ibaraki

Publication date 23 February 2000

Mathematics Subject Classification ID

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

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

Cited in

(5)

• Algorithms and Computation
• scientific article; zbMATH DE number 1187147 (Why is no real title available?)
• An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree
• Edge capacity augmentation problem on spanning trees in networks
• scientific article; zbMATH DE number 1833404 (Why is no real title available?)

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)