Approximate <i>L</i>(δ<sub>1</sub>,δ<sub>2</sub>,…,δ<sub><i>t</i></sub>)‐coloring of trees and interval graphs (Q3442863)
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 5156349
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximate <i>L</i>(δ<sub>1</sub>,δ<sub>2</sub>,…,δ<sub><i>t</i></sub>)‐coloring of trees and interval graphs |
scientific article; zbMATH DE number 5156349 |
Statements
Approximate <i>L</i>(δ<sub>1</sub>,δ<sub>2</sub>,…,δ<sub><i>t</i></sub>)‐coloring of trees and interval graphs (English)
0 references
23 May 2007
0 references
wireless networks
0 references
channel assignment
0 references
\(L(\delta_{1}, \delta_{2},\dots,\delta _{t})\)-coloring
0 references
interval graphs
0 references
trees
0 references
approximation algorithms
0 references
0.803349494934082
0 references
0.8030639886856079
0 references
0.8020520806312561
0 references
