A 7/6-approximation algorithm for the minimum 2-edge connected subgraph problem in bipartite cubic graphs

DOI10.1016/J.IPL.2016.04.011MaRDI QIDQ284336zbMATH OpenOpenAlexFDO

Authors Kenjiro Takazawa

Publication date 18 May 2016

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2016.04.011

zbMATH Keywords

approximation algorithms\(\{3,4\}\)-covering 2-factorsminimum 2-edge connected spanning subgraphs

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Connectivity (05C40)

Recommendations

• A 7/6-approximation algorithm for the max-min connected bipartition problem on grid graphs
• A 4/3-approximation algorithm for the minimum 2-edge connected subgraph problem
• Toward a 6/5 bound for the minimum cost 2-edge connected subgraph problem
• A $4/3$-Approximation Algorithm for the Minimum $2$-Edge Connected Multisubgraph Problem in the Half-Integral Case
• A $\frac{4}{3}$-Approximation Algorithm for the Minimum 2-Edge Connected Multisubgraph Problem in the Half-Integral Case
• Approximation schemes for minimum 2-edge-connected and biconnected subgraphs in planar graphs
• A new approximation algorithm for the minimum 2-edge-connected spanning subgraph problem
• An improved approximation algorithm for the minimum k -edge connected multi-subgraph problem
• An Approximation Algorithm for the Minimum-Cost k-Vertex Connected Subgraph
• scientific article; zbMATH DE number 1187147

Cites work

• scientific article; zbMATH DE number 3694608 (Why is no real title available?)
• scientific article; zbMATH DE number 2119646 (Why is no real title available?)
• Biconnectivity approximations and graph carvings
• Cycles Intersecting Edge-Cuts of Prescribed Sizes
• Finding 2-edge connected spanning subgraphs.
• Finding 2-factors closer to TSP tours in cubic graphs
• Improved Approximations for Cubic Bipartite and Cubic TSP
• Improving on the 1. 5-approximation of a smallest 2-edge connected spanning subgraph
• Shorter tours by nicer ears: 7/5-approximation for the graph-TSP, 3/2 for the path version, and 4/3 for two-edge-connected subgraphs
• TSP tours in cubic graphs: beyond 4/3

Cited in

(5)

• Finding a maximum 2-matching excluding prescribed cycles in bipartite graphs
• A \(\frac{5}{4}\)-approximation for subcubic 2EC using circulations and obliged edges
• A \(\frac{5}{4}\)-approximation for subcubic 2EC using circulations
• Efficient constructions of convex combinations for 2-edge-connected subgraphs on fundamental classes
• A new approximation algorithm for the minimum 2-edge-connected spanning subgraph problem

This page was built for publication: A 7/6-approximation algorithm for the minimum 2-edge connected subgraph problem in bipartite cubic graphs

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