Complexity results on labeled shortest path problems from wireless routing metrics (Q2270086)
From MaRDI portal
!
WARNING
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 5681221
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity results on labeled shortest path problems from wireless routing metrics |
scientific article; zbMATH DE number 5681221 |
Statements
Complexity results on labeled shortest path problems from wireless routing metrics (English)
0 references
12 March 2010
0 references
wireless routing metrics
0 references
labeled paths
0 references
shortest paths
0 references
approximation algorithms
0 references
0.7388360500335693
0 references
0.7378259897232056
0 references
0.7231252789497375
0 references
0.7140673398971558
0 references
0.713595449924469
0 references
