Improved Algorithm for Maximum Independent Set on Unit Disk Graph
type: Item
instance of: scholarly article
title: Improved Algorithm for Maximum Independent Set on Unit Disk Graph
zbMATH Open document ID: 1417.68288
DOI: 10.1007/978-3-319-29221-2_18
author: Ramesh K. Jallu
author: Gautam K. Das
published in: Algorithms and Discrete Applied Mathematics
publication date: 2016-03-23T00:00:00Z
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 05C62
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68U05
Mathematics Subject Classification ID: 68W40
zbMATH DE Number: 6559682
zbMATH Keywords: maximum independent set
zbMATH Keywords: unit disk graph
zbMATH Keywords: approximation algorithm
MaRDI profile type: Publication
full work available at URL: 978-3-319-29221-2 18
OpenAlex ID: W2397470036
cites work: Label placement by maximum independent set in rectangles
cites work: Polynomial-time approximation schemes for packing and piercing fat objects
cites work: Approximation algorithms for maximum independent set of pseudo-disks
cites work: Approximation algorithms for maximum independent set of a unit disk graph
cites work: Q4947407
cites work: Polynomial-Time Approximation Schemes for Geometric Intersection Graphs
cites work: Q4198056
cites work: Q4886045
cites work: Approximation schemes for covering and packing problems in image processing and VLSI
cites work: Graph-Theoretic Concepts in Computer Science
cites work: Simple heuristics for unit disk graphs
cites work: Q4504025
cites work: Q3694703
description: scientific article; zbMATH DE number 6559682