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

DOI10.1016/j.ipl.2016.04.011zbMath1357.68298OpenAlexW2342657557MaRDI QIDQ284336

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 theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Connectivity (05C40)

Related Items (2)

Finding a maximum 2-matching excluding prescribed cycles in bipartite graphs ⋮ Efficient constructions of convex combinations for 2-edge-connected subgraphs on fundamental classes

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• Finding 2-edge connected spanning subgraphs.
• Improving on the 1.5-Approximation of a Smallest 2-Edge Connected Spanning Subgraph
• Finding 2-Factors Closer to TSP Tours in Cubic Graphs
• Improved Approximations for Cubic Bipartite and Cubic TSP
• Cycles Intersecting Edge-Cuts of Prescribed Sizes
• Biconnectivity approximations and graph carvings
• TSP Tours in Cubic Graphs: Beyond 4/3

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