scientific article; zbMATH DE number 1542609

DOI10.1002/1097-0037(200010)36:3%3C172::AID-NET4%3E3.0.CO;2-PMaRDI QIDQ4520241zbMATH OpenFDO

Authors Zeev Nutov

Publication date 12 December 2000

Full work available at URL https://doi.org/10.1002/1097-0037(200010)36:3%3C172::AID-NET4%3E3.0.CO;2-P

zbMATH Keywords

approximation algorithmrooted 3-outconnected subgraph

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• scientific article; zbMATH DE number 1305534
• scientific article; zbMATH DE number 1182763
• Approximating the maximum 3-edge-colorable subgraph problem
• A linear time algorithm for computing 3-edge-connected components in a multigraph
• An Ear Decomposition Approach to Approximating the Smallest 3-Edge Connected Spanning Subgraph of a Multigraph
• scientific article; zbMATH DE number 2119647
• A 2-Approximation Algorithm for Finding an Optimum 3-Vertex-Connected Spanning Subgraph
• scientific article; zbMATH DE number 3963193
• Subgraph isomorphism for biconnected outerplanar graphs in cubic time
• A $4/3$-Approximation Algorithm for the Minimum $2$-Edge Connected Multisubgraph Problem in the Half-Integral Case

Cites work

• scientific article; zbMATH DE number 437545 (Why is no real title available?)
• scientific article; zbMATH DE number 1305534 (Why is no real title available?)
• scientific article; zbMATH DE number 3236772 (Why is no real title available?)
• Private Observation, Communication and Collusion

Cited in

(3)

• scientific article; zbMATH DE number 1305534 (Why is no real title available?)
• scientific article; zbMATH DE number 1182763 (Why is no real title available?)
• On rooted node-connectivity problems

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 Q4520241)