A BETTER APPROXIMATION FOR MINIMUM AVERAGE ROUTING PATH CLUSTERING PROBLEM IN 2-D UNDERWATER SENSOR NETWORKS (Q3397508)
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: A BETTER APPROXIMATION FOR MINIMUM AVERAGE ROUTING PATH CLUSTERING PROBLEM IN 2-D UNDERWATER SENSOR NETWORKS |
scientific article; zbMATH DE number 5606190
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A BETTER APPROXIMATION FOR MINIMUM AVERAGE ROUTING PATH CLUSTERING PROBLEM IN 2-D UNDERWATER SENSOR NETWORKS |
scientific article; zbMATH DE number 5606190 |
Statements
A BETTER APPROXIMATION FOR MINIMUM AVERAGE ROUTING PATH CLUSTERING PROBLEM IN 2-D UNDERWATER SENSOR NETWORKS (English)
0 references
22 September 2009
0 references
polynomial time approximation scheme
0 references
underwater sensor networks
0 references
wireless network clustering
0 references
Minimum Weight Dominating Set
0 references
0.9470441937446594
0 references
0.7726701498031616
0 references
0.725481390953064
0 references
0.7196379899978638
0 references
0.6956890225410461
0 references
