Title

The maximum distance-d independent set problem on unit disk graphs

Document Type

Conference Article

Publication Title

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Abstract

In this article, we study the maximum distance-d independent set problem, a variant of the maximum independent set problem, on unit disk graphs. We first show that the problem is NP-hard. Next, we propose a polynomial-time constant-factor approximation algorithm and a PTAS for the problem.

First Page

68

Last Page

80

DOI

10.1007/978-3-319-78455-7_6

Publication Date

1-1-2018

This document is currently not available here.

Share

COinS