Abstract
The minimum 2-edge connected spanning subgraph problem in 3-edge connected cubic bipartite graphs is addressed. For the nonbipartite case, the previous best approximation ratio has been 6/5. We exhibit the advantage of bipartiteness to attain an improved ratio 7/6.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
