Approximation for a scheduling problem with application in wireless networks (Q989801): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s11425-010-3077-9 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1989170887 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Faster communication in known topology radio networks / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Smallest-last ordering and clustering and graph coloring algorithms / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3742257 / rank | |||
Normal rank | |||
Latest revision as of 02:26, 3 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximation for a scheduling problem with application in wireless networks |
scientific article |
Statements
Approximation for a scheduling problem with application in wireless networks (English)
0 references
23 August 2010
0 references
approximation algorithm
0 references
conflict-aware
0 references
many-to-one data aggregation
0 references
latency
0 references
wireless sensor network
0 references
