New results on the time complexity and approximation ratio of the Broadcast Incremental Power algorithm (Q987839): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2103235438 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Automata, Languages and Programming / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2747613 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Minimum-energy broadcasting in static ad hoc wireless networks / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 02:53, 3 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | New results on the time complexity and approximation ratio of the Broadcast Incremental Power algorithm |
scientific article |
Statements
New results on the time complexity and approximation ratio of the Broadcast Incremental Power algorithm (English)
0 references
16 August 2010
0 references
approximation algorithms
0 references
analysis of algorithms
0 references
wireless ad hoc network
0 references
minimum energy broadcast
0 references