Faster approximation for maximum independent set on unit disk graph

Authors

Subhas C. Nandy, Indian Statistical Institute, Kolkata
Supantha Pandit, Indian Statistical Institute, Kolkata
Sasanka Roy, Indian Statistical Institute, Kolkata

Article Type

Research Article

Publication Title

Information Processing Letters

Abstract

Maximum independent set from a given set D of unit disks intersecting a horizontal line can be solved in O(n2) time and O(n2) space. As a corollary, we design a factor 2 approximation algorithm for the maximum independent set problem on unit disk graph which takes both time and space of O(n2). The best known factor 2 approximation algorithm for this problem runs in O(n2log⁡n) time and takes O(n2) space [1,2].

First Page

58

Last Page

61

DOI

10.1016/j.ipl.2017.07.007

Publication Date

11-1-2017

Comments

Open Access, Green

Recommended Citation

Nandy, Subhas C.; Pandit, Supantha; and Roy, Sasanka, "Faster approximation for maximum independent set on unit disk graph" (2017). Journal Articles. 2363.
https://digitalcommons.isical.ac.in/journal-articles/2363