Lahiri, Abhiruk and Mukherjee, Joydeep and Subramanian, CR (2015) Maximum Independent Set on B-1-VPG Graphs. In: 9th Annual International Conference on Combinatorial Optimization and Applications (COCOA), DEC 18-20, 2015, Houston, TX, pp. 633-646.
Full text not available from this repository. (Request a copy)Abstract
We present two approximation algorithms for the maximum independent set (MIS) problem over the class of B-1-VPG graphs and also for the subclass, equilateral B-1-VPG graphs. The first algorithm is shown to have an approximation guarantee of O((log n)(2)) whereas the second one is shown to have an approximation guarantee of O(log d) where d denotes the ratio d(max)/d(min) and d(max) and d(min) denote respectively the maximum and minimum length of of any arm in the input L-representation of the graph. No approximation algorithms have been known for the MIS problem for these graph classes before. Also, the NP-completeness of the decision version restricted to unit length equilateral B-1-VPG graphs is established.
| Item Type: | Conference Proceedings |
|---|---|
| Series.: | Lecture Notes in Computer Science |
| Publisher: | SPRINGER INT PUBLISHING AG |
| Additional Information: | Copy right for this article belongs to the SPRINGER INT PUBLISHING AG, GEWERBESTRASSE 11, CHAM, CH-6330, SWITZERLAND |
| Department/Centre: | Division of Electrical Sciences > Computer Science & Automation |
| Date Deposited: | 22 Jun 2016 06:24 |
| Last Modified: | 22 Jun 2016 06:24 |
| URI: | http://eprints.iisc.ac.in/id/eprint/54066 |
Actions (login required)
 |
View Item |
