Abstract
We consider the MAXIMUM PLANAR SUBGRAPH problem — given a graph G, find a largest planar subgraph of G. This problem has applications in circuit layout, facility layout, and graph drawing. We improve to 4/9 the best known approximation ratio for the MAXIMUM PLANAR SUBGRAPH problem. We also consider a generalization of the previous problem, the MAXIMUM GENUS D SUBGRAPH problem — given a connected graph G, find a maximum subgraph of G of genus at most D. For the latter problem, we present a simple algorithm whose approximation ratio is 1/4.
Sign-in/Register to access full text options 
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.
