A BETTER APPROXIMATION FOR MINIMUM AVERAGE ROUTING PATH CLUSTERING PROBLEM IN 2-D UNDERWATER SENSOR NETWORKS (Q3397508): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: A \(5+\varepsilon\)-approximation algorithm for minimum weighted dominating set in unit disk graph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Planar Formulae and Their Uses / rank | |||
Normal rank | |||
Latest revision as of 00:19, 2 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A BETTER APPROXIMATION FOR MINIMUM AVERAGE ROUTING PATH CLUSTERING PROBLEM IN 2-D UNDERWATER SENSOR NETWORKS |
scientific article |
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
