Lahiri, A and Mukherjee, J and Subramanian, CR (2021) On approximating MIS over B1-VPG graphs. In: Discrete Mathematics, Algorithms and Applications .
Full text not available from this repository.Abstract
In this paper, we present an approximation algorithm for the maximum independent set (MIS) problem over the class of B1-VPG graphs when the input is specified by a B1-VPG representation. We obtain a 6(logn)2-approximation algorithm running in O(n(logn)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 B1-VPG graphs. © 2022 World Scientific Publishing Company.
| Item Type: | Journal Article |
|---|---|
| Publication: | Discrete Mathematics, Algorithms and Applications |
| Publisher: | World Scientific |
| Additional Information: | The copyright for this article belongs to World Scientific |
| Keywords: | Approximation algorithms; combinatorial optimisation; geometric intersection graphs; independent sets |
| Department/Centre: | Division of Electrical Sciences > Computer Science & Automation |
| Date Deposited: | 31 Dec 2021 07:11 |
| Last Modified: | 31 Dec 2021 07:11 |
| URI: | http://eprints.iisc.ac.in/id/eprint/70780 |
Actions (login required)
 |
View Item |
