Radio aggregation scheduling
THEORETICAL COMPUTER SCIENCE, pp. 143-153, 2020.
EI
Abstract:
We consider the aggregation problem in radio networks: find a spanning tree in a given graph and a conflict-free schedule of the edges so as to minimize the latency of the computation. While a large body of literature exists on this and related problems, we give the first approximation results in graphs that are not induced by unit ranges...More
Code:
Data:
Upload PDF
1.Your uploaded documents will be check within 24h, and coins will be credited to your account.
2.As the current system does not support cash withdrawal, you can add staff WeChat (AMxiaomai) to receive it as a red packet.
3.10 coins will be exchanged for 1 yuan.
?
￥
Upload a single paper
for 5 coins
Wechat's Red Packet
?
￥
Upload 50 articles
for 280 coins
Wechat's Red Packet
?
￥
Upload 200 articles
for 1200 coins
Wechat's Red Packet
?
￥
Upload 500 articles
for 3000 coins
Wechat's Red Packet
?
￥
Upload 1000 articles
for 7000 coins
Wechat's Red Packet
Tags
Comments