Simple heuristics for unit disk graphs
type: Item
instance of: scholarly article
title: Simple heuristics for unit disk graphs
zbMATH Open document ID: 0821.90128
author: Heinz Breu
author: S. S. Ravi
author: Madhav V. Marathe
author: H. B. III Hunt
author: Daniel J. Rosenkrantz
published in: Networks
publication date: 1995-06-12T00:00:00Z
full work available at URL: https://arxiv.org/abs/math/9409226
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 755103
zbMATH Keywords: unit disk graphs
zbMATH Keywords: maximum independent set
zbMATH Keywords: minimum vertex cover
zbMATH Keywords: minimum coloring
zbMATH Keywords: minimum dominating set
zbMATH Keywords: on-line coloring heuristic
MaRDI profile type: Publication
OpenAlex ID: W2139349113
Wikidata QID: Q56019093
arXiv ID: math/9409226
cites work: Q4230322
cites work: Q4198056
cites work: Q3328583
cites work: On the hardness of approximating minimization problems
cites work: Q3975168
DOI: 10.1002/NET.3230250205
DBLP publication ID: journals/networks/MaratheBHRR95
Recommended article: Graph-Theoretic Concepts in Computer Science
Recommended article: Linear-Time Approximation Algorithms for Unit Disk Graphs
Recommended article: Q5710442
Recommended article: Plane hop spanners for unit disk graphs: simpler and better
Recommended article: An optimal algorithm for \(L_1\) shortest paths in unit-disk graphs
Recommended article: Planar Hop Spanners for Unit Disk Graphs
Recommended article: Plane hop spanners for unit disk graphs
Recommended article: Near-optimal algorithms for shortest paths in weighted unit-disk graphs
Recommended article: Near-Optimal Algorithms for Shortest Paths in Weighted Unit-Disk Graphs.
description: scientific article; zbMATH DE number 755103