Abstract
In this paper, we present an approximation algorithm for the maximum independent set (MIS) problem over the class of [Formula: see text]-VPG graphs when the input is specified by a [Formula: see text]-VPG representation. We obtain a [Formula: see text]-approximation algorithm running in [Formula: see text] time. This is an improvement over the previously best [Formula: see text]-approximation algorithm [J. Fox and J. Pach, Computing the independence number of intersection graphs, in Proc. Twenty-Second Annual ACM-SIAM Symp. Discrete Algorithms (SODA 2011), 2011, pp. 1161–1165, doi:10.1137/1.9781611973082.87] (for some fixed [Formula: see text]) designed for some subclasses of string graphs, on [Formula: see text]-VPG graphs.
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.
