An 8-approximation algorithm for \(L(2 ,1)\)-labeling of unit disk graphs (Q6069154)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7764548
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An 8-approximation algorithm for \(L(2 ,1)\)-labeling of unit disk graphs |
scientific article; zbMATH DE number 7764548 |
Statements
An 8-approximation algorithm for \(L(2 ,1)\)-labeling of unit disk graphs (English)
0 references
13 November 2023
0 references
frequency/channel assignment
0 references
graph algorithm
0 references
distance-constrained labeling
0 references
\(L(2, 1)\)-labeling
0 references
approximation algorithm
0 references
unit disk graph
0 references
0 references
0.9546866416931152
0 references
0.8297251462936401
0 references
0.8186342716217041
0 references
0.8171623945236206
0 references
0.8100470900535583
0 references
