• On approximating MIS over B1-V...

*Result*: On approximating MIS over B1-VPG graphs.

Title:
On approximating MIS over B1-VPG graphs.
Authors:
Lahiri, Abhiruk1 (AUTHOR) abhiruk.lahiri@csa.iisc.ac.in, Mukherjee, Joydeep2 (AUTHOR) joydeep.m1981@gmail.com, Subramanian, C. R.3 (AUTHOR) crs@imsc.res.in
Source:
Discrete Mathematics, Algorithms & Applications. Oct2022, Vol. 14 Issue 7, p1-13. 13p.
Subject Terms:
*INTERSECTION numbers, *INDEPENDENT sets, *APPROXIMATION algorithms, *INTERSECTION graph theory, *ALGORITHMS
Database:
Academic Search Index

*Further Information*

*In this paper, we present an approximation algorithm for the maximum independent set (MIS) problem over the class of B 1 -VPG graphs when the input is specified by a B 1 -VPG representation. We obtain a 6 (log n) 2 -approximation algorithm running in O (n (log n) 3) time. This is an improvement over the previously best n -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 > 0) designed for some subclasses of string graphs, on B 1 -VPG graphs. [ABSTRACT FROM AUTHOR]*