Approximation and heuristic algorithms for computing backbones in asymmetric ad-hoc networks (Q2322692)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Approximation and heuristic algorithms for computing backbones in asymmetric ad-hoc networks |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation and heuristic algorithms for computing backbones in asymmetric ad-hoc networks |
scientific article |
Statements
Approximation and heuristic algorithms for computing backbones in asymmetric ad-hoc networks (English)
0 references
5 September 2019
0 references
ad-hoc networks
0 references
virtual backbone
0 references
dominating sets
0 references
disk graphs
0 references
distributed algorithms
0 references
0 references
0 references
0 references
0.9411272406578064
0 references
0.8115561604499817
0 references
0.7992191910743713
0 references
0.7836238741874695
0 references
0.7728565335273743
0 references
